{"raw_statement":[{"iden":"problem statement","content":"You are given an integer $N$. Consider permuting the digits in $N$ and separate them into two **positive integers**.\nFor example, for the integer $123$, there are six ways to separate it, as follows:\n\n*   $12$ and $3$,\n*   $21$ and $3$,\n*   $13$ and $2$,\n*   $31$ and $2$,\n*   $23$ and $1$,\n*   $32$ and $1$.\n\nHere, the two integers after separation must not contain leading zeros. For example, it is not allowed to separate the integer $101$ into $1$ and $01$. Additionally, since the resulting integers must be positive, it is not allowed to separate $101$ into $11$ and $0$, either.\nWhat is the maximum possible product of the two resulting integers, obtained by the optimal separation?"},{"iden":"constraints","content":"*   $N$ is an integer between $1$ and $10^9$ (inclusive).\n*   $N$ contains two or more digits that are not $0$."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"123"},{"iden":"sample output 1","content":"63\n\nAs described in Problem Statement, there are six ways to separate it:\n\n*   $12$ and $3$,\n*   $21$ and $3$,\n*   $13$ and $2$,\n*   $31$ and $2$,\n*   $23$ and $1$,\n*   $32$ and $1$.\n\nThe products of these pairs, in this order, are $36$, $63$, $26$, $62$, $23$, $32$, with $63$ being the maximum."},{"iden":"sample input 2","content":"1010"},{"iden":"sample output 2","content":"100\n\nThere are two ways to separate it:\n\n*   $100$ and $1$,\n*   $10$ and $10$.\n\nIn either case, the product is $100$."},{"iden":"sample input 3","content":"998244353"},{"iden":"sample output 3","content":"939337176"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}