Sum of Digits

Problem Description

Xiaoyang has $n$ positive integers. He wants to know the maximum digit sum among these numbers. The "digit sum" of a number is the sum of all its digits. For example, for the number $12345$, its digits are $1,2,3,4,5$; adding them gives $1+2+3+4+5=15$, so the digit sum of $12345$ is $15$.

Input Format

The first line contains a positive integer $n$, the number of positive integers.

The next $n$ lines each contain a positive integer.

Output Format

Output the maximum digit sum among these positive integers.

Sample Input

3
16
81
10

Sample Output

9

Sample Explanation

Among the three numbers in the sample: the digit sum of $16$ is $1+6=7$, of $81$ is $8+1=9$, of $10$ is $1+0=1$. The maximum is $9$.

Constraints

For all data, $1 \le n \le 10^5$, and each positive integer does not exceed $10^{12}$.