13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T6ad,

A subarray is a continuous part of array.

Yarik recently found an array $$$a$$$ of $$$n$$$ elements and became very interested in finding the maximum sum of a non empty subarray. However, Yarik doesn't like consecutive integers with the same parity, so the subarray he chooses must have alternating parities for adjacent elements.

For example, $$$[1, 2, 3]$$$ is acceptable, but $$$[1, 2, 4]$$$ is not, as $$$2$$$ and $$$4$$$ are both even and adjacent.

You need to help Yarik by finding the maximum sum of such a subarray.

Input

The first line contains an integer $$$t$$$ $$$(1 \le t \le 10^4)$$$ — number of test cases. Each test case is described as follows.

The first line of each test case contains an integer $$$n$$$ $$$(1 \le n \le 2 \cdot 10^5)$$$ — length of the array.

The second line of each test case contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ $$$(-10^3 \le a_i

Yarik and Array

Examples