#include <iostream>
#include <cstdio>
#include <cstring>
#include <set>
#include <map>
#include <stack>
#include <vector>
#include <string>
#include <queue>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
const int mod = int(1e9) + 7, INF = 0x3fffffff, M = int(1e5) + 17;
int n, m, a[1000];


int main(void) {
    int T;
    cin >> T;
    for (int cas = 1; cas <= T; cas++) {
        cin >> n;
        for(int i = 0; i < n; i++) {
            cin >> a[i];
        }
        int cnt = 0, l = n;
        for(int i = n - 1; i >= 0; i--) {
            if(a[i] == l) {
                cnt++;
                l--;
            }
        }
        printf("%d\n", n - cnt);
    }
    return 0;
}