#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define inf 1000000000000000LL
#define mod 1000000007LL
#define FOR(i,a,b) for(int i = a; i < b; i++)

void solve() {
    ll n;
    cin >> n;
    vector <ll> l1(n);
    vector <vector <ll>>adj(n+1);
    vector <ll> cnt(n+1,0); ll mex = 0;
    for (int i = 0; i < n; i++){
        cin >> l1[i];
        if (l1[i] <= n)
            adj[l1[i]].push_back(i);
    }
    ll v =0; 
    for (int i = 0; i < n; i++){
        v += (l1[i] > 0);
    }
    if (adj[0].size() ==0){
        cout << v << "\n"; return;
    }
    auto update_mex = [&](){
        while (cnt[mex] >= 1){
            mex++;
        }
    };
    for (int i = n-1; i >= 0; i--){
        update_mex();
        if (i < adj[0][0]){
            if (l1[i] < mex){
                cout << v << "\n";
                return;
            }
        }
        if (l1[i] != 0 && l1[i] <= n){
            cnt[l1[i]]++;
        }
        if (i == adj[0][0]){
            cnt[0]++;
            continue;
        }
    }
    cout << v + 1 << "\n";
}

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

    ll t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}