#include <bits/stdc++.h>
using namespace std;
const int N = 3005;
const int inf = 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
int t;
int n;
int a[N];
int pref[N][N];
int suf[N][N];
int main() {
  cin >> t;
  while (t--) {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
    }
    for (int i = 1; i <= n; i++) {
      suf[n + 1][i] = 0;
    }
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= n; j++) {
        pref[i][j] = pref[i - 1][j];
      }
      pref[i][a[i]]++;
    }
    for (int i = n; i >= 1; i--) {
      for (int j = 1; j <= n; j++) {
        suf[i][j] = suf[i + 1][j];
      }
      suf[i][a[i]]++;
    }
    long long answ = 0;
    for (int i = 2; i <= n; i++) {
      for (int j = i + 1; j < n; j++) {
        answ += pref[i - 1][a[j]] * 1ll * suf[j + 1][a[i]];
      }
    }
    printf("%lld\n", answ);
  }
  return 0;
}
