/* Problem URL: https://codeforces.com/problemset/problem/2044/G2 */

#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;
    vi p(n);
    vvi rev(n);
    rep(i, n) {
        cin >> p[i];
        p[i]--;
        rev[p[i]].push_back(i);
    }

    V<bool> vis(n);
    V<bool> loop(n);
    vvi ne(20, vi(n, -1));

    rep(i, n) {
        ne[0][i] = p[i];
    }

    function<void(int)> getloop = [&](int i) {
        vis[i] = true;
        int t = p[i];
        int h = p[t];

        while (t != h) {
            if (vis[t]) {
                return;
            }

            vis[t] = true;

            t = p[t];
            h = p[p[h]];
        }

        vis[t] = true;
        loop[t] = true;
        h = p[h];
        while (h != t) {
            loop[h] = true;
            vis[h] = true;
            h = p[h];
        }
    };

    rep(i, n) {
        if (vis[i]) {
            continue;
        }

        getloop(i);
    }

    ll ans = 0;
    function<ll(int)> dfs = [&](int i) {
        ll ans = 1;
        repv(j, rev[i]) {
            ans += dfs(j);
        }
        return ans;
    };

    rep(i, n) {
        if (!loop[i]) {
            continue;
        }

        repv(j, rev[i]) {
            if (loop[j]) {
                continue;
            }

            rmax(ans, dfs(j));
        }
    }

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

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

    pre();

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