{"raw_statement":[{"iden":"problem statement","content":"There are $N$ trees. The $i$\\-th tree bears $A_i$ nuts.\nChipmunk will harvest nuts from the trees in the following manner:\n\n*   From a tree with $10$ or fewer nuts, she does not take nuts.\n*   From a tree with more than $10$ nuts, she takes all but $10$ nuts.\n\nFind the total number of nuts Chipmunk will take from the trees."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 1000$\n*   $0 \\leq A_i \\leq 1000$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"3\n6 17 28"},{"iden":"sample output 1","content":"25\n\nFrom the three trees, Chipmunk will take $0$, $7$, and $18$ nuts, for a total of $25$ nuts."},{"iden":"sample input 2","content":"4\n8 9 10 11"},{"iden":"sample output 2","content":"1"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}