Max Odd Sum
##### Submissions: 1082   Accuracy: 21.48%   Difficulty: Basic   Marks: 1

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 <= 104

1 <= A[i] <= 105

Example:
Input:
3
5
2 5 -4 3 -1
4
4 -3 3 -5
3
2 4 6

Output:
9
7
-1

#### ** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harsh Agarwal
Author: harsh.agarwal0

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.