{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ consisting of digits between `1` and `9`, inclusive. You will insert at most $K$ commas (`,`) into this string to separate it into multiple numbers.\nYour task is to minimize the maximum number among those produced by inserting commas. Find minimum possible such value."},{"iden":"constraints","content":"*   $0 ≦ K < |S| ≦ 100,000$\n*   $S$ consists of digits between `1` and `9`, inclusive."},{"iden":"partial scores","content":"*   In the test set worth $100$ points, $|S| ≦ 2$.\n*   In the test set worth another $100$ points, $|S| ≦ 16$.\n*   In the test set worth another $200$ points, $|S| ≦ 100$.\n*   In the test set worth another $200$ points, $|S| ≦ 2,000$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$K$\n$S$"},{"iden":"sample input 1","content":"2\n15267315"},{"iden":"sample output 1","content":"315\n\nWhen the string is separated into $152$, $67$ and $315$, the maximum among these is $315$, which is the minimum possible value."},{"iden":"sample input 2","content":"0\n12456174517653111"},{"iden":"sample output 2","content":"12456174517653111\n\n$12456174517653111$ itself is the answer."},{"iden":"sample input 3","content":"8\n127356176351764127645176543176531763517635176531278461856198765816581726586715987216581"},{"iden":"sample output 3","content":"5317635176"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}