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 sys import stdin, stdout\nfrom collections import defaultdict\nfor _ in range(int(stdin.readline())):\n    n=int(stdin.readline())\n    lst=list(map(int, stdin.readline().split()))\n    prefix_odd=[0]*n\n    prefix_even=[0]*n\n    odd_val=0\n    even_val=0\n    for i in range(n):\n        if lst[i]%2==0:\n            even_val+=1 \n        else:\n            odd_val+=1\n        prefix_even[i]=even_val\n        prefix_odd[i]=odd_val\n    #print(prefix_odd,prefix_even)\n    prefix_sum=[0]*n\n    s=0\n    for i in range(n):\n        s+=lst[i]\n        prefix_sum[i]=s\n    #print(prefix_sum)\n    dict={}\n    count={}\n    for i in range(n):\n        if lst[i] not in dict:\n            dict[lst[i]]=i\n            count[lst[i]]=1\n        else:\n            dict[lst[i]]=i\n            count[lst[i]]+=1\n    #print(dict)\n    graph=defaultdict(list)\n    for i in range(n):\n        graph[lst[i]].append(i)\n    max_sum=0\n    for i in graph:\n        if len(graph[i])>1:\n            prev=graph[i][0]\n            for j in range(1,len(graph[i])):\n                index2=graph[i][j]\n                index1=prev\n                prev=index2\n                #print(index1,index2)\n                if i%2==0:\n                    val=prefix_even[index2]-prefix_even[index1]-1\n                    #print(val)\n                    if val%2==0:\n                        temp_sum=prefix_sum[index2]-prefix_sum[index1]-i\n                        #print(temp_sum)\n                        if temp_sum>max_sum:\n                            max_sum=temp_sum\n                else:\n                    val=prefix_odd[index2]-prefix_odd[index1]-1\n                    #print(val)\n                    if val%2!=0:\n                        temp_sum=prefix_sum[index2]-prefix_sum[index1]-i\n                        #print(temp_sum)\n                        if temp_sum>max_sum:\n                            max_sum=temp_sum\n\n    '''max_sum=-1\n                for i in range(n):\n                    if count[lst[i]]>1:\n                        index2=dict[lst[i]]\n                        index1=i\n                        print(index1,index2)\n                        if lst[i]%2==0:\n                            val=prefix_even[index2]-prefix_even[index1]-1\n                            print(val)\n                            if val%2==0:\n                                temp_sum=prefix_sum[index2]-prefix_sum[index1]-lst[i]\n                                print(temp_sum)\n                                if temp_sum>max_sum:\n                                    max_sum=temp_sum\n                        else:\n                            val=prefix_odd[index2]-prefix_odd[index1]-1\n                            print(val)\n                            if val%2!=0:\n                                temp_sum=prefix_sum[index2]-prefix_sum[index1]-lst[i]\n                                print(temp_sum)\n                                if temp_sum>max_sum:\n                                    max_sum=temp_sum'''\n    \n    stdout.write(str(max_sum)+'\\n')"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14587