/* Problem URL: https://codeforces.com/problemset/problem/1781/D */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

const int oo = INT32_MAX >> 1;
const ll OO = INT64_MAX >> 1;


void pre()
{

}

#define TEST 1

void solve()
{
    int n;
    cin >> n;
    vl a(n);
    cin >> a;

    set<ll> cand;

    auto getcand = [&](ll a, ll b) {
        ll diff = b - a;
        for (ll i = 1; i * i <= diff; i++) {
            if (diff % i == 0) {
                ll p2 = (diff / i - i);
                ll q2 = (diff / i + i);

                if (p2 < 0 || q2 < 0 || (p2 & 1) || (q2 & 1)) {
                    continue; 
                }

                p2 >>= 1;
                q2 >>= 1;

                cand.insert(p2 * p2 - a);
                cand.insert(q2 * q2 - b);
            }
        }
    };

    rep(i, n - 1) {
        nrep(j, i + 1, n) {
            getcand(a[i], a[j]);
        }
    }

    cand.insert(0);

    auto issquare = [&](ll a) {
        ll lim = sqrtl(a);
        return lim * lim == a;
    };

    int ans = 1;
    repv(now, cand) {
        if (now < 0) {
            continue;
        }

        int cur = 0; 
        rep(j, n) {
            if (issquare(a[j] + now)) {
                cur++;
            }
        }

        rmax(ans, cur);
    }

    cout << ans << '\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    pre();

    int t;
    (TEST && cin >> t) || (t = 1);
    while (t--) {
        solve();
    }
}