#include <bits/stdc++.h>
using namespace std;
int spf[101];
int fac[101];
int add(int a, int b) {
  if (a + b > 1000000007)
    return a + b - 1000000007;
  else
    return a + b;
}
int sub(int a, int b) {
  if (a - b < 0)
    return a - b + 1000000007;
  else
    return a - b;
}
void sieve() {
  spf[1] = 1;
  for (int i = 2; i < 101; i++) spf[i] = i;
  for (int i = 4; i < 101; i += 2) spf[i] = 2;
  for (int i = 3; i * i < 101; i++) {
    if (spf[i] == i) {
      for (int j = i * i; j < 101; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<int, int> getfactor(int a) {
  map<int, int> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
int power(int x, int y, int p) {
  int res = 1;
  x = x % p;
  if (x == 0 || y < 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
int gcd(int a, int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int inverse(int a, int p) { return power(a, p - 2, p); }
int ncr(int n, int r, int p) {
  if (r > n) return 0;
  if (r == 0 || r == n) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
void solve() {
  int n;
  cin >> n;
  vector<int> v[n + 1];
  int a[n + 1];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    v[a[i]].push_back(i);
  }
  int dp[n + 1][n + 1];
  memset(dp, 0, sizeof(dp));
  for (int j = 1; j < n; j++) {
    for (int i = 1; i <= n - j; i++) {
      if (a[i] == a[i + 1]) {
        dp[i][i + j] = dp[i + 1][i + j];
        continue;
      }
      dp[i][i + j] = 1 + dp[i + 1][i + j];
      for (auto &it : v[a[i]]) {
        if (it <= i + j && it > i + 1)
          dp[i][i + j] =
              min(dp[i][i + j], dp[it][i + j] + dp[i + 1][it - 1] + 1);
      }
    }
  }
  cout << dp[1][n] << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int test = 1;
  cin >> test;
  while (test--) {
    solve();
  }
}
