{"raw_statement":[{"iden":"problem statement","content":"For a positive integer $x$, let $f(x)$ denote the sum of its digits. For instance, $f(158) = 1 + 5 + 8 = 14$, $f(2023) = 2 + 0 + 2 + 3 = 7$, and $f(1) = 1$.\nYou are given a sequence of positive integers $A = (A_1, \\ldots, A_N)$. Find $\\sum_{i=1}^N\\sum_{j=1}^N f(A_i + A_j)$."},{"iden":"constraints","content":"*   $1\\leq N\\leq 2\\times 10^5$\n*   $1\\leq A_i < 10^{15}$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$A_1$ $\\ldots$ $A_N$"},{"iden":"sample input 1","content":"2\n53 28"},{"iden":"sample output 1","content":"36\n\nWe have $\\sum_{i=1}^N\\sum_{j=1}^N f(A_i + A_j) = f(A_1+A_1)+f(A_1+A_2)+f(A_2+A_1)+f(A_2+A_2)=7+9+9+11=36$."},{"iden":"sample input 2","content":"1\n999999999999999"},{"iden":"sample output 2","content":"135\n\nWe have $\\sum_{i=1}^N\\sum_{j=1}^N f(A_i + A_j) = f(A_1+A_1) = 135$."},{"iden":"sample input 3","content":"5\n123 456 789 101 112"},{"iden":"sample output 3","content":"321"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}