#include <bits/stdc++.h>

using namespace std;
using ll = long long;

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

    vector<vector<int> > edge(n + 1);
    vector<int> fa(n + 1);
    int st;
    for (int i = 1; i <= n; ++i) {
        int x;
        cin >> x;
        if (x) {
            fa[i] = x;
            edge[x].push_back(i);
        } else {
            st = i;
        }
    }

    vector<int> num(n + 1), dep(n + 1), all(n + 1);
    auto dfs = [&](auto &&self, int u) -> void {
        dep[u] = dep[fa[u]] + 1;
        all[dep[u]]++;
        if (!edge[u].empty()) {
            num[dep[u]]++;
        }
        for (auto v : edge[u]) {
            self(self, v);
        }
    };

    int ans = 1;
    vector<int> pd(n + 1);
    auto dfs1 = [&](auto &&self, int u) -> void {
        if (edge[u].empty()) return;
        if (!pd[dep[u]] && (all[dep[u]] == 1 || num[dep[u]] > 1) && (int)edge[u].size() > 1) {
            ans++;
            pd[dep[u]] = 1;
        }
        for (auto v : edge[u]) {
            self(self, v);
        }
    };

    dfs(dfs, st);
    dfs1(dfs1, st);

    // for (int i = 1; i <= 5; ++i) {
    //     cerr << num[i] << " num\n";
    // }

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

int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    int _;
    cin >> _;
    while (_--) solve();

    return 0;
}
/*
2
3
0 1 2
7
0 1 2 2 1 4 1
*/
/*
1
4
0 1 2 2 
*/
/*
1
7
0 1 1 3 1 5 5
*/