#include <bits/stdc++.h>

using i64 = long long;

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

    std::vector<int> deg(n + 1);
    std::vector<std::vector<int>> adj(n + 1);
    for (int i = 1; i <= n; i++) {
        int p;
        std::cin >> p;

        adj[p].emplace_back(i);
        deg[p]++;
    }

    int ans = 0, more = 0;
    auto dfs = [&](auto self, int u, int f) -> void {
        if (deg[u] > 0) {
            if (more > 0) {
                more--;
            } else {
                ans++;
            }
        }
        std::sort(adj[u].begin(), adj[u].end(), [&](int i, int j) {
            return deg[i] < deg[j];
        });
        for (const auto &v : adj[u]) {
            if (v == f) {
                continue;
            }
            --deg[u];
            if (!deg[u]) {
                more++;
            }
            self(self, v, u);
        }
    };
    dfs(dfs, 1, 0);

    std::cout << ans << "\n";
}

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

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}