18.29

Given an array of integers, check whether there is a subsequence with odd sum and if yes, then finding the maximum odd sum. If no subsequence contains odd sum, print -1.

**Input:**

First line of input contains a single integer T which denotes the number of test cases. Then T test cases follows. First line of each test case contains a single integer N which denotes the number of elements in the array. Second line of each test case contains N space separated integers.

**Output:**

For each test case print the maximum odd sum that can be obtained from any subsequence of the given array. If no subsequence contains odd sum, print -1.

**Constraints:**

1<=T<=100

1<=N<=10^{4}

**Example:**

**Input:**

3

5

2 5 -4 3 -1

4

4 -3 3 -5

3

2 4 6

**Output:**

9

7

-1