There are $n$ people who want to participate in a boat competition. The weight of the $i$-th participant is $w_i$. Only teams consisting of two people can participate in this competition. As an organizer, you think that it's fair to allow only teams with the same total weight.

So, if there are $k$ teams $(a_1, b_1)$, $(a_2, b_2)$, $\dots$, $(a_k, b_k)$, where $a_i$ is the weight of the first participant of the $i$-th team and $b_i$ is the weight of the second participant of the $i$-th team, then the condition $a_1 + b_1 = a_2 + b_2 = \dots = a_k + b_k = s$, where $s$ is the total weight of each team, should be satisfied.

Your task is to choose such $s$ that the number of teams people can create is the maximum possible. Note that each participant can be in no more than one team.

You have to answer $t$ independent test cases.


-----Input-----

The first line of the input contains one integer $t$ ($1 \le t \le 1000$) — the number of test cases. Then $t$ test cases follow.

The first line of the test case contains one integer $n$ ($1 \le n \le 50$) — the number of participants. The second line of the test case contains $n$ integers $w_1, w_2, \dots, w_n$ ($1 \le w_i \le n$), where $w_i$ is the weight of the $i$-th participant.


-----Output-----

For each test case, print one integer $k$: the maximum number of teams people can compose with the total weight $s$, if you choose $s$ optimally.


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

Output
2
3
4
1
2



-----Note-----

In the first test case of the example, we can reach the optimal answer for $s=6$. Then the first boat is used by participants $1$ and $5$ and the second boat is used by participants $2$ and $4$ (indices are the same as weights).

In the second test case of the example, we can reach the optimal answer for $s=12$. Then first $6$ participants can form $3$ pairs.

In the third test case of the example, we can reach the optimal answer for $s=3$. The answer is $4$ because we have $4$ participants with weight $1$ and $4$ participants with weight $2$.

In the fourth test case of the example, we can reach the optimal answer for $s=4$ or $s=6$.

In the fifth test case of the example, we can reach the optimal answer for $s=3$. Note that participant with weight $3$ can't use the boat because there is no suitable pair for him in the list.
[{"code": "for _ in range(int(input())):\n    n = int(input())\n    wt = list(map(int, input().split()))\n    count = {}\n    for x in wt:\n        if x not in count:\n            count[x] = 0\n        count[x] += 1\n    k = 0\n\n    for s in range(101):\n        temp = 0\n        temp2 = 0\n        for x in count:\n            if (s - x) in count:\n                if (s - x) == x:\n                    temp2 += count[x] // 2\n                else:\n                    temp += min(count[x], count[s -x])\n        \n        k = max(k, temp//2 + temp2)\n    print(k)\n", "passed": true, "time": 0.22, "memory": 14304.0, "status": "done"}, {"code": "t=int(input())\nfor _ in range(t):\n    n=int(input())\n    a=list(map(int,input().split()))\n    a.sort()\n    ga=0\n    for i in range(1,2*n+1):\n        j,k=0,n-1 \n        flag=True\n        ans=0\n        while(j<k):\n            if a[j]+a[k]>i:\n                k-=1 \n            elif a[j]+a[k]<i:\n                j+=1 \n            else:\n                j+=1 \n                k-=1 \n                ans+=1 \n        ga=max(ans,ga)\n    print(ga)\n", "passed": true, "time": 0.14, "memory": 14104.0, "status": "done"}, {"code": "import sys\ninput = sys.stdin.readline\nfrom collections import Counter\n\nt=int(input())\nfor tests in range(t):\n    n=int(input())\n    W=list(map(int,input().split()))\n    C=Counter(W)\n\n    ANS=0\n\n    for i in range(n):\n        for j in range(i+1,n):\n            B=W[i]+W[j]\n\n            A=0\n\n            for c in C:\n                if c*2==B:\n                    A+=C[c]//2\n\n                elif c*2<B:\n                    A+=min(C[c],C[B-c])\n\n            ANS=max(ANS,A)\n\n    print(ANS)\n\n    \n", "passed": true, "time": 0.14, "memory": 14248.0, "status": "done"}, {"code": "import sys, math\nimport io, os\n#data = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\nfrom bisect import bisect_left as bl, bisect_right as br, insort\nfrom heapq import heapify, heappush, heappop\nfrom collections import defaultdict as dd, deque, Counter\n#from itertools import permutations,combinations\ndef data(): return sys.stdin.readline().strip()\ndef mdata(): return list(map(int, data().split()))\ndef outl(var) : sys.stdout.write(' '.join(map(str, var))+'\\n')\ndef out(var) : sys.stdout.write(str(var)+'\\n')\nfrom decimal import Decimal\nfrom fractions import Fraction\n#sys.setrecursionlimit(100000)\nINF = float('inf')\nmod = int(1e9)+7\n\nfor t in range(int(data())):\n    n=int(data())\n    w=sorted(mdata())\n    ans=0\n    for i in range(2,2*max(w)+1):\n        cnt=0\n        s,e=0,n-1\n        while s<e:\n            if w[s]+w[e]==i:\n                cnt+=1\n                s+=1\n                e-=1\n            elif w[s]+w[e]<i:\n                s+=1\n            else:\n                e-=1\n        ans=max(ans,cnt)\n    out(ans)\n\n", "passed": true, "time": 0.15, "memory": 14128.0, "status": "done"}, {"code": "for _ in range(int(input())):\n    n = int(input())\n    u = list(map(int, input().split()))\n    d = [0] * n\n    for i in range(n):\n        d[u[i] - 1] += 1\n    ans = 0\n    for s in range(1, 2 * n + 1):\n        d1 = d[:]\n        cnt = 0\n        for i in range(n):\n            if 0 <= s - u[i] - 1 < n and d1[s - u[i] - 1] > 0:\n                cnt += 1\n                d1[s - u[i] - 1] -= 1\n        ans = max(ans, cnt)\n    print(ans // 2)\n        \n", "passed": true, "time": 0.15, "memory": 14244.0, "status": "done"}, {"code": "def solve():\n    n = int(input())\n    a = list(map(int, input().split()))\n    a.sort()\n    c = [0] * (n + 1)\n    for i in a:\n        c[i] += 1\n    ans = 0\n    for tw in range(1, 101):\n        cans = 0\n        b = [0] * (n + 1)\n        for i in a:\n            j = tw - i\n            if j > n or j <= 0:\n                continue\n            if i != j and c[i] - b[i] >= 1 and c[j] - b[j] >= 1 \\\n                    or i == j and c[i] - b[i] >= 2:\n                b[i] += 1\n                b[j] += 1\n                cans += 1\n        ans = max(ans, cans)\n    print(ans)\n\nt = int(input())\nfor _ in range(t):\n    solve()", "passed": true, "time": 0.14, "memory": 14232.0, "status": "done"}, {"code": "t = int(input())\nfor _ in range(t):\n    n = int(input())\n    ws = sorted(map(int, input().split()))\n    ans = 0\n    for s in range(2, 101):\n        count = 0\n        l = 0\n        r = n - 1\n        while r > l:\n            if ws[l] + ws[r] == s:\n                l += 1\n                r -= 1\n                count += 1\n            elif ws[l] + ws[r] < s:\n                l += 1\n            else:\n                r -= 1\n        ans = max(ans, count)\n    print(ans)", "passed": true, "time": 0.14, "memory": 14304.0, "status": "done"}, {"code": "from collections import defaultdict\n\nt = int(input())\n\nfor _ in range(t):\n    n = int(input())\n    w = list(map(int, input().split()))\n    counts = defaultdict(int)\n    for x in w:\n        counts[x] += 1\n    \n    m = 0\n    for s in range(2, n*2+1):\n        count = 0\n        for x in list(counts.keys()):\n            xcount = counts[x]\n            if x < s-x:            \n                c = counts[s-x]\n                count += min(c, xcount)\n            elif x == s-x:\n                count += xcount//2\n            \n        m = max(m, count)\n    print(m)\n            \n", "passed": true, "time": 0.63, "memory": 14244.0, "status": "done"}, {"code": "from bisect import bisect_left\nimport sys\ninput=sys.stdin.readline\nt = int(input())\n\nfor _ in range(t):\n    l = int(input())\n    a = list(map(int,input().split()))\n    a.sort()\n    \n    ans = 0\n    \n    for w in range(1,2*l+1):\n        c = 0\n        used = {}\n        for i in range(len(a)):\n            for j in range(i+1, len(a)):\n                if a[i] + a[j] == w and i not in used and j not in used:\n                    c += 1\n                    used[i] = 1\n                    used[j] = 1\n        ans = max(c, ans)\n    print(ans)", "passed": true, "time": 0.15, "memory": 14328.0, "status": "done"}, {"code": "#!/usr/bin/env pypy3\n\nfrom collections import Counter\n\ndef score(cN, target):\n\tret1 = 0\n\tret2 = 0\n\tfor k in cN:\n\t\tif 2*k == target:\n\t\t\tret1 += cN[k] // 2\n\t\telse:\n\t\t\tl = target - k\n\t\t\tret2 += min(cN[k], cN[l])\n\treturn ret1 + ret2//2\n\ndef ans(N):\n\tN = sorted(N)\n\tcN = Counter(N)\n\n\treturn max(score(cN, target) for target in range(2, 101))\n\nT = int(input())\nfor t in range(T):\n\tinput()\n\tN = list(map(int, input().split()))\n\t\n\tprint(ans(N))", "passed": true, "time": 0.15, "memory": 14288.0, "status": "done"}, {"code": "t = int(input())\nfor _ in range(t):\n\tn = int(input())\n\tarr = [int(j) for j in input().split()]\n\n\tcount = [0]*101\n\n\tfor x in arr:\n\t\tcount[x] += 1\n\n\tans = 0\n\tfor i in range(1, 101):\n\t\ttemp = 0\n\t\tfor j in range(1, i+1):\n\t\t\ttemp += min(count[j], count[i-j])\n\t\ttemp //= 2\n\t\tans = max(ans, temp)\n\tprint(ans)\n", "passed": true, "time": 0.15, "memory": 14128.0, "status": "done"}, {"code": "t = int(input())\nfor _ in range(t):\n    n = int(input())\n    w = list(map(int, input().split()))\n    m = min(w)\n    M = max(w)\n    ans = 0\n    for i in range(m*2, M*2+1):\n        d = dict()\n        tmp = 0\n        for x in w:\n            if i - x in d and d[i-x] > 0:\n                d[i-x] -= 1\n                tmp += 1\n            else:\n                if x in d:\n                    d[x] += 1\n                else:\n                    d[x] = 1\n        if ans < tmp:\n            ans = tmp\n        # print(tmp, i)\n    print(ans)\n", "passed": true, "time": 0.14, "memory": 14196.0, "status": "done"}, {"code": "\nfor _ in range(int(input())):\n    n = int(input())\n    w = list(sorted(map(int, input().split())))\n    ma = 0\n    for s in range(2,2*n+1):\n        l = 0\n        r = n-1\n        cnt = 0\n        while l < r:\n            cs = w[l] + w[r]\n            if cs == s:\n                cnt += 1\n                l += 1\n                r -= 1\n            elif cs < s:\n                l += 1\n            else:\n                r -= 1\n        ma = max(cnt, ma)\n\n    print(ma)\n\n", "passed": true, "time": 0.14, "memory": 14092.0, "status": "done"}]