#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const long double eps = 1e-12;
const long double pi = acos(-1.0);
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint &a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint &a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[a - b];
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> ri(n);
  vector<int> va;
  for (int i = 0; i < n; i++) va.push_back(a[i]);
  sort((va).begin(), (va).end());
  va.erase(unique((va).begin(), (va).end()), va.end());
  for (int i = 0; i < n; i++) {
    a[i] = lower_bound((va).begin(), (va).end(), a[i]) - va.begin();
  }
  vector<vector<int>> loc(va.size());
  for (int i = 0; i < n; i++) {
    loc[a[i]].push_back(i);
  }
  int ma = 0;
  for (int i = 0; i < va.size(); i++) {
    ma = max(ma, (int)loc[i].size());
  }
  for (int i = n - 1; i >= 0; i--) {
    int val = a[i];
    if (val + 1 == va.size()) continue;
    int id = lower_bound((loc[val + 1]).begin(), (loc[val + 1]).end(), i) -
             loc[val + 1].begin();
    if (id == loc[val + 1].size()) continue;
    int sum = loc[val + 1].size() - id;
    sum +=
        lower_bound((loc[val]).begin(), (loc[val]).end(), i) - loc[val].begin();
    sum++;
    ma = max(ma, sum);
  }
  vector<int> ans(n, 0);
  for (int i = n - 1; i >= 0; i--) {
    int val = a[i];
    int num;
    num =
        lower_bound((loc[val]).begin(), (loc[val]).end(), i) - loc[val].begin();
    num = loc[val].size() - num;
    ans[i] = max(ans[i], num);
    if (val + 1 != va.size()) {
      int id = lower_bound((loc[val + 1]).begin(), (loc[val + 1]).end(), i) -
               loc[val + 1].begin();
      if (id == 0) {
        int to = loc[val + 1][id];
        if (loc[val][0] == i && loc[val].back() < to) {
          ans[i] = max(ans[i], ans[to] + (int)loc[val].size());
        }
      }
      if (loc[val][0] == i) {
        int las = loc[val].back();
        int toid =
            lower_bound((loc[val + 1]).begin(), (loc[val + 1]).end(), las) -
            loc[val + 1].begin();
        ans[i] =
            max(ans[i], (int)loc[val + 1].size() - toid + (int)loc[val].size());
      }
    }
    if (val + 1 != va.size()) {
      int id = lower_bound((loc[val + 1]).begin(), (loc[val + 1]).end(), i) -
               loc[val + 1].begin();
      if (id == 0) {
        int to = loc[val + 1][id];
        num = lower_bound((loc[val]).begin(), (loc[val]).end(), i) -
              loc[val].begin();
        ma = max(ma, ans[to] + num + 1);
      }
    }
  }
  cout << n - ma << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) solve();
  char nyaa;
  cin >> nyaa;
  return 0;
}
