Tallest Wall

You are given T test cases. For each test case, you will be provided with an integer N representing the number of bricks and a list of N positive integers which denote the heights of the bricks. Your task is to build the tallest wall possible using all the bricks. Since you have to use every brick, the tallest wall is simply the sum of all brick heights.

More formally, if the heights are \(a_1, a_2, \ldots, a_N\), then the height of the wall is given by \[ H = \sum_{i=1}^{N} a_i \]

inputFormat

The input is read from standard input (stdin) and has the following format:

1. The first line contains a single integer T, the number of test cases.
2. For each test case, the first line contains an integer N denoting the number of bricks.
3. The second line of each test case contains N space-separated positive integers representing the heights of the bricks.

outputFormat

For each test case, output a single line containing one integer – the height of the tallest wall (i.e. the sum of the brick heights).

## sample

1
5
3 1 4 1 5

14

</p>