#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
template <typename T>
void etch(T V) {
  for (auto x : V) cout << x << ' ';
  cout << '\n';
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) long long int idx,
               __attribute__((unused)) long long int LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, long long int idx, long long int LINE_NUM,
               Head H, Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
const long long int MOD = 1e9 + 7;
const long long int MOD1 = 998244353;
const long long int N = 2e5 + 5;
const long long int INF = 1000111000111000111LL;
const long double EPS = 1e-12;
const long double PI = 3.141592653589793116;
long long int fre[3001][3001];
long long int nc4(long long int &n) {
  long long int val = (n * (n - 1) * (n - 2) * (n - 3)) / 24;
  return val;
}
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> v(n);
  for (long long int i = (0); i < (n); i++) cin >> v[i];
  unordered_map<long long int, vector<long long int> > dp;
  for (long long int i = (0); i < (n + 1); i++) {
    for (long long int j = (0); j < (n + 1); j++) fre[i][j] = 0;
  }
  for (long long int i = (0); i < (n); i++) {
    dp[v[i]].push_back(i + 1);
  }
  vector<vector<long long int> > g;
  for (auto it : dp) {
    g.push_back(it.second);
  }
  for (long long int i = 0; i < (long long int)((g).size()); i++) {
    for (auto it : g[i]) {
      fre[i][it] = 1;
    }
  }
  for (long long int i = 0; i < (long long int)((g).size()); i++) {
    for (long long int j = 1; j <= n; j++) {
      fre[i][j] += fre[i][j - 1];
    }
  }
  long long int ans = 0;
  for (long long int x = 0; x < (long long int)((g).size()); x++) {
    long long int l = (long long int)((g[x]).size());
    ans += nc4(l);
    for (long long int y = x + 1; y < (long long int)((g).size()); y++) {
      for (long long int i = 0; i < l; i++) {
        for (long long int j = i + 1; j < l; j++) {
          long long int c1 = fre[y][g[x][j]] - fre[y][g[x][i]];
          long long int c2 = fre[y][n] - fre[y][g[x][j]];
          long long int c3 = fre[y][g[x][i]];
          ans += (c1 * (c2 + c3));
        }
      }
    }
  }
  cout << ans << '\n';
}
int32_t main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int T;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
