For a positive integer $x$, let $f(x)$ denote the sum of its digits. For instance, we have $f(153) = 1 + 5 + 3 = 9$, $f(2023) = 2 + 0 + 2 + 3 = 7$, and $f(1) = 1$. You are given a sequence of positive integers $A = (A_1, \ldots, A_N)$. Find the minimum possible value of $\sum_{i=1}^N f(A_i + x)$ where $x$ is a non-negative integer.

The input is given from Standard Input in the following format: >$N$ $A_1$ $\ldots$ $A_N$ #### Constraints - $1\leq N\leq 2\times 10^5$ - $1\leq A_i < 10^9$

Print the minimum possible value of $\sum_{i=1}^N f(A_i + x)$ where $x$ is a non-negative integer.