Codeforces Round 964 (Div. 4) |
---|
Finished |
Given a two-digit positive integer $$$n$$$, find the sum of its digits.
The first line contains an integer $$$t$$$ ($$$1 \leq t \leq 90$$$) — the number of test cases.
The only line of each test case contains a single two-digit positive integer $$$n$$$ ($$$10 \leq n \leq 99$$$).
For each test case, output a single integer — the sum of the digits of $$$n$$$.
87721403419841099
14 3 4 7 10 12 1 18
Name |
---|