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\n# JUST FIND IT\ndef splitting(arr):\n    if len(arr) == len(set(arr)):\n        return 0\n    ev_od = {}\n    occur = {}\n    ans = 0\n    for i, n in enumerate(arr):\n        if i == 0:\n            ev_od[i] = [0, 0, 0]\n        else:\n            if arr[i-1] & 1 == 1:\n                ev_od[i] = [ev_od[i-1][0], ev_od[i-1][1] + 1, ev_od[i-1][2] + arr[i-1]]\n            else:\n                ev_od[i] = [ev_od[i-1][0] + 1, ev_od[i-1][1], ev_od[i-1][2] + arr[i-1]]\n        if n in occur:\n            if n & 1 == 1:\n                num_of_odd = ev_od[i][1] - ev_od[occur[n]][1] - 1\n                if num_of_odd & 1 == 1:\n                    tmp_sum = ev_od[i][2] - ev_od[occur[n]][2] - n\n                else:\n                    tmp_sum = 0\n            else:\n                num_of_even = ev_od[i][0] - ev_od[occur[n]][0] - 1\n                if num_of_even & 1 == 0:\n                    tmp_sum = ev_od[i][2] - ev_od[occur[n]][2] - n\n                else:\n                    tmp_sum = 0\n            # print(tmp_sum)\n            ans = max(ans, tmp_sum)\n        occur[n] = i\n    return ans\n\ntry:\n    t = int(input())\n    for i in range(t):\n        n = int(input())\n        arr = list(map(int, input().split()))\n        print(splitting(arr))\nexcept:\n    pass\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13153