{"problem":{"name":"Select Mul","description":{"content":"You are given an integer $N$. Consider permuting the digits in $N$ and separate them into two **positive integers**. For example, for the integer $123$, there are six ways to separate it, as follows: ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc221_c"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   $N$ is an integer between $1$ and $10^9$ (inclusive).\n*   $N$ contains two or more digits that are not $0$.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc221_c","tags":[],"sample_group":[["123","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."],["1010","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$."],["998244353","939337176"]],"created_at":"2026-03-03 11:01:14"}}