Reverse Digit Sum

You are given a list of strings, each representing a non-negative integer. Your task is to concatenate these strings into a single number, reverse the digits of this number, and then compute the sum of the reversed digits.

Note: If the input list is empty or contains an empty string, the output should be 0.

For example, if the input strings are "12", "34", and "5", the concatenated number is 12345, which when reversed becomes 54321. The sum of these digits is 5+4+3+2+1 = 15.

Mathematically, if the concatenated number is represented as \(N\) and its reversed form as \(R\), then the answer is \(\sum_{i=1}^{k} d_i\) where \(d_i\) is the \(i^{th}\) digit of \(R\).

inputFormat

The input is read from standard input. The first line contains an integer \(n\), representing the number of strings. The second line contains \(n\) space-separated strings, each being a non-negative integer (possibly with leading zeros or even empty).

outputFormat

Output a single integer to standard output—the sum of the digits of the reversed concatenated number.

1
12

3