Given an array $A$ of length $N$.
We have to find the $maximum$ sum of elements of the subarray between $two$ nearest occurrences of $same$ elements (excluding both).
If both the elements are $even$ then the total number of $even$ elements in that subarray should be $even$ then and then only we consider that subarray and if both the elements are $odd$ then the total number of $odd$ element in that subarray should be $odd$ then and then only we consider that subarray.
If the condition never matches print $0$.

-----Input:-----
- First line contains $T$, number of test cases. Then the test cases follow.
- Each testcase consists of two lines: 
The first line has $N$ : number of elements in the array and second-line has $N$ space separated integers: elements of the array.

-----Output:-----
- For each test case, output in a single line $maximum$ sum.

-----Constraints-----
- $1 \leq T \leq 10$
- $3 \leq N \leq 2*10^5$
- $1 \leq A[i] \leq 10^8$
$NOTE $: Use of Fast Input Output is recommended.

-----Sample Input:-----
1
10
1 2 3 2 1 5 1 2 8 2

-----Sample Output:-----
7

-----EXPLANATION:-----
The maximum sum is 7, between 1 at  1st position and 1 at 5th position i.e sum of 2,3,2

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# cook your dish here\nfrom collections import defaultdict\nfor _ in range(int(input())):\n   maxi=-1\n   d=defaultdict(list)\n   n=int(input())\n   a=list(map(int,input().split()))\n   even=[0]*n\n   odd=[0]*n\n   pref=[0]*n\n   pref[0]=a[0]\n   if a[0]%2==0:\n       even[0]=1\n   if a[0]%2==1:\n       odd[0]=1\n   d[a[0]].append(0)\n\n   for i in range(1,n):\n       d[a[i]].append(i)\n       if a[i]%2==0:\n           even[i]=even[i-1]+1\n           odd[i]=odd[i-1]\n       if a[i]%2==1:\n           odd[i]=odd[i-1]+1\n           even[i]=even[i-1]\n\n       pref[i]=pref[i-1]+a[i]\n  ## print(even)\n   ##print(odd)\n   for i in range(n):\n\n       x=a[i]\n       if len(d[a[i]])>=2:\n           if x%2==0:\n               y=d[a[i]][0]\n               z=d[a[i]][1]\n               ##print(even[z])\n               if y==0:\n\n                   ##print(even[z],i)\n                   if even[z]%2==0:\n                       maxi = max(maxi, pref[z] - pref[y] - x)\n                   continue\n\n               if (even[z]-even[y-1])%2==0:\n                       maxi=max(maxi,pref[z]-pref[y]-x)\n               ##print(maxi,i,"hi")\n\n           if x%2==1:\n               y = d[a[i]][0]\n               z = d[a[i]][1]\n               if y==0:\n                  ## print(odd[z])\n                   if odd[z]%2==1:\n                       maxi = max(maxi, pref[z] - pref[y] - x)\n                   continue\n\n               if (odd[z] - odd[y - 1]) % 2 == 1:\n                   maxi = max(maxi, pref[z] - pref[y] - x)\n       d[a[i]].pop(0)\n   if maxi==-1:\n       print(0)\n       continue\n   print(maxi)\n\n\n\n\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14903