#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;

const int N = 2e5;

    int n, rt, p[N + 3];
    vector<int>g[N + 3];

    int d[N + 3], md[N + 3];

void dfs0(int u){
    md[u] = d[u] = d[p[u]] + 1;
    for(int i = 0, v; i < g[u].size(); i++){
        v = g[u][i];

        dfs0(v);
        md[u] = max(md[u], md[v]);
    }
}

bool cmp(int i, int j){
    return md[i] < md[j];
}

    int ans;

void dfs(int u, int x){
    ans = max(ans, x);
    for(int i = 0, v; i < g[u].size(); i++){
        v = g[u][i];

        if(i < g[u].size() - 1)
            dfs(v, x + 1);
        else 
            dfs(v, x);
    }
}

void sol(){
    scanf("%d", &n);
    for(int i = 1; i <= n; i++)
        g[i].clear();

    rt = -1;

    for(int i = 1; i <= n; i++){
        scanf("%d", &p[i]);
        g[p[i]].push_back(i);
        if(p[i] == 0)
            rt = i;
    }

    d[0] = 0;
    dfs0(rt);

    for(int i = 1; i <= n; i++)
        sort(g[i].begin(), g[i].end(), cmp);

    ans = 0;
    dfs(rt, 0);

    printf("%d\n", ans + 1);

}

int main(){
    int T;
    scanf("%d", &T);
    while(T--)
        sol();

    return 0;
}