#include <bits/stdc++.h>
using namespace std;

#define all(x) (x).begin(), (x).end()
#define repeat(x) for(int taramtam = 0;taramtam<(x);taramtam++)

template<typename S, typename T> void semax(S &a, const T &b) {if (a<b) a = b;}
template<typename S, typename T> void semin(S &a, const T &b) {if (a>b) a = b;}

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << ' ' << H;dbg_out(T...);}
#define debug(...) cerr << "(" #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

const int INF = 1e9+100;
const int MOD = 1e9+7;

#define int long long
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename S>
void displayvec(vector<S> a){
    for (S thing:a){
        cout << thing << ' ';
    }
    cout << '\n';
}
template <typename S> 
void readvec(vector<S>& a){
    for (S& thing:a){
        cin>>thing;
    }
}

void solve(){
    int n;cin>>n;
    vector<int> a(n);
    readvec(a);
    sort(all(a));
    int res = 0;
    for(int i = -100000;i<=100000;i++){
        if (i==0)continue;
        set<int> s(all(a));
        int r = 0;
        for(auto thing:a){
            if (s.count(thing)){
            if (s.count(thing+i)){
                r++;
                s.erase(thing+i);
                s.erase(thing);
            }
        }
        }
        if (r>res){
           // cout << i << '\n';
        }
        res=max(res, r);
    }
    int r = 0;
    multiset<int> s(all(a));
    for(auto thing:a){
        if (s.count(thing)>=2){
            r++;
            s.erase(s.find(thing));
            s.erase(s.find(thing));
        }
    }
    if (r>res){
        // cout << i << '\n';
    }
    res=max(res, r);
    cout <<res << '\n';
}







signed main() {
    ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    //freopen("compin.txt", "r", stdin);
	//freopen("compout.txt", "w", stdout);
    int TestCase = 1;
    cin >> TestCase;
    while(TestCase--) solve();
}