Problem: This is an easy version of the problem. In this version, all numbers in the given array are distinct and the constraints on n are less than in the hard version of the problem.

You are given an array a of n integers (there are no equals elements in the array). You can perform the following operations on array elements:

  1. choose any index i (1 ≤ i ≤ n) and move the element a[i] to the begin of the array; 
  2. choose any index i (1 ≤ i ≤ n) and move the element a[i] to the end of the array. 



For example, if n = 5, a = [4, 7, 2, 3, 9], then the following sequence of operations can be performed: 

  * after performing the operation of the first type to the second element, the array a will become [7, 4, 2, 3, 9]; 
  * after performing the operation of the second type to the second element, the array a will become [7, 2, 3, 9, 4]. 



You can perform operations of any type any number of times in any order.

Find the minimum total number of operations of the first and second type that will make the a array sorted in non-decreasing order. In other words, what is the minimum number of operations that must be performed so the array satisfies the inequalities a[1] ≤ a[2] ≤ … ≤ a[n].

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases in the test. Then t test cases follow.

Each test case starts with a line containing an integer n (1 ≤ n ≤ 3000) — length of the array a.

Then follow n integers a_1, a_2, …, a_n (0 ≤ a_i ≤ 10^9) — an array that needs to be sorted by the given operations. All numbers in the given array are distinct.

The sum of n for all test cases in one test does not exceed 3000.

Output

For each test case output one integer — the minimum total number of operations of the first and second type, which will make the array sorted in non-decreasing order.

Example

Input


4
5
4 7 2 3 9
5
3 5 8 1 7
5
1 4 5 7 12
4
0 2 1 3


Output


2
2
0
2

Note

In the first test case, you first need to move 3, and then 2 to the beginning of the array. Therefore, the desired sequence of operations: [4, 7, 2, 3, 9] → [3, 4, 7, 2, 9] → [2, 3, 4, 7, 9].

In the second test case, you need to move the 1 to the beginning of the array, and the 8 — to the end. Therefore, the desired sequence of operations: [3, 5, 8, 1, 7] → [1, 3, 5, 8, 7] → [1, 3, 5, 7, 8].

In the third test case, the array is already sorted.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long INF = LLONG_MAX;
const long long SZ = 3e3 + 5;
const long long mod = 1e9 + 7;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long n;
long long a[SZ];
vector<long long> v, v1;
long long lst[SZ];
long long f[SZ];
struct data {
  long long mn, mx;
} tree[SZ * 4];
void build(long long node, long long r1, long long r2) {
  long long bam = node * 2;
  long long dan = bam + 1;
  if (r1 == r2) {
    tree[node].mn = tree[node].mx = f[r1];
    return;
  }
  long long mid = (r1 + r2) / 2;
  build(bam, r1, mid);
  build(dan, mid + 1, r2);
  tree[node].mn = min(tree[bam].mn, tree[dan].mn);
  tree[node].mx = max(tree[bam].mx, tree[dan].mx);
}
long long query_mn(long long node, long long r1, long long r2, long long i,
                   long long j) {
  long long bam = node * 2;
  long long dan = bam + 1;
  if (r1 > j || r2 < i) return INF;
  if (r1 >= i && r2 <= j) return tree[node].mn;
  long long mid = (r1 + r2) / 2;
  long long p1 = query_mn(bam, r1, mid, i, j);
  long long p2 = query_mn(dan, mid + 1, r2, i, j);
  return min(p1, p2);
}
long long query_mx(long long node, long long r1, long long r2, long long i,
                   long long j) {
  long long bam = node * 2;
  long long dan = bam + 1;
  if (r1 > j || r2 < i) return -INF;
  if (r1 >= i && r2 <= j) return tree[node].mx;
  long long mid = (r1 + r2) / 2;
  long long p1 = query_mx(bam, r1, mid, i, j);
  long long p2 = query_mx(dan, mid + 1, r2, i, j);
  return max(p1, p2);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long cs, tc = 1, x, y, z, i, j, k, g, p, q, ans = 0, sum = 0, c = 0,
                t = 0;
  string s, s1, s2;
  cin >> tc;
  while (tc--) {
    cin >> n;
    set<long long> st;
    unordered_map<long long, long long, custom_hash> m;
    v.clear();
    v1.clear();
    for (i = 1; i <= n; i++) {
      lst[i] = 0;
      f[i] = 0;
    }
    for (i = 1; i <= n; i++) {
      cin >> a[i];
      st.insert(a[i]);
      v.push_back(a[i]);
      v1.push_back(a[i]);
    }
    sort(v1.begin(), v1.end());
    if (v == v1) {
      cout << "0\n";
      continue;
    }
    c = 0;
    for (auto v : st) {
      m[v] = ++c;
    }
    for (i = 1; i <= n; i++) {
      a[i] = m[a[i]];
      f[a[i]] = i;
    }
    build(1, 1, c);
    for (i = 1; i <= n; i++) {
      x = a[i];
      lst[x] = x;
      for (j = x + 1; j <= c; j++) {
        if (f[j] > f[j - 1])
          lst[x] = j;
        else
          break;
      }
    }
    ans = INF;
    for (i = 1; i <= c; i++) {
      for (j = i + 1; j <= c; j++) {
        (f[i] == 1) ? x = 0 : x = 1;
        (f[j] == n) ? y = 0 : y = 1;
        x += (i - 1);
        y += (n - j);
        if (lst[i + 1] < j - 1) continue;
        if (query_mx(1, 1, c, 1, i) > f[j] &&
            query_mx(1, 1, c, i + 1, j - 1) < f[j])
          y--;
        else if (query_mn(1, 1, c, j, c) < f[i] &&
                 query_mn(1, 1, c, i + 1, j - 1) > f[i])
          x--;
        ans = min(ans, x + y);
      }
    }
    cout << ans << "\n";
  }
  return 0;
}