{"raw_statement":[{"iden":"problem statement","content":"Takahashi has an integer $x$. Initially, $x=0$.\nTakahashi may do the following operation any number of times.\n\n*   Choose an integer $i\\ (1\\leq i \\leq 9)$. Pay $C_i$ yen (the currency in Japan) to replace $x$ with $10x + i$.\n\nTakahashi has a budget of $N$ yen. Find the maximum possible value of the final $x$ resulting from operations without exceeding the budget."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^6$\n*   $1 \\leq C_i \\leq N$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$C_1$ $C_2$ $\\ldots$ $C_9$"},{"iden":"sample input 1","content":"5\n5 4 3 3 2 5 3 5 3"},{"iden":"sample output 1","content":"95\n\nFor example, the operations where $i = 9$ and $i=5$ in this order change $x$ as:\n$0 \\rightarrow 9 \\rightarrow 95$.\nThe amount of money required for these operations is $C_9 + C_5 = 3 + 2 = 5$ yen, which does not exceed the budget. Since we can prove that we cannot make an integer greater than or equal to $96$ without exceeding the budget, the answer is $95$."},{"iden":"sample input 2","content":"20\n1 1 1 1 1 1 1 1 1"},{"iden":"sample output 2","content":"99999999999999999999\n\nNote that the answer may not fit into a $64$\\-bit integer type."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}