string-addition-3

You will be given N strings. You need to add them. String contains {[a-z][A-Z][0-9]}.
Order of value of each character is 0 < 1 < 2 < ... < 9 < a < b < ... < z.
Also, a=A, b=B, c=C, ... , z=Z.

Input Format:
First line gives T, number of test cases.
Each test case has a number N in first line.
Next N lines has a string each.

Output Format:
For each test case, print a resultant sum of strings in new line. Print exact number of characters as in the value of sum. No leading zeros should be printed. Output string should only have characters from set {[a-z][0-9]}.

Constraints:
1 ≤ T ≤ 500
1 ≤ N ≤ 100
1 ≤ |S| ≤ 100
Si ∈ {[a-z][A-Z][0-9]}

SAMPLE INPUT
2
2
123
abc
2
111
Xyz

SAMPLE OUTPUT
bdf
z00

Source: hackerearth | Difficulty: EASY
Tags: Implementation

Ad-hoc


Solutions: