#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 3010;
int t, n, a[MAX_N];
int pref[MAX_N][MAX_N], suff[MAX_N][MAX_N];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
      cin >> a[i];
    }
    for (int i = 1; i <= n + 3; ++i) {
      for (int j = 1; j <= n; ++j) pref[i][j] = suff[i][j] = 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 + 2; i > 0; --i) {
      for (int j = 1; j <= n; ++j) suff[i][j] = suff[i + 1][j];
      if (i <= n) ++suff[i][a[i]];
    }
    long long ans = 0;
    for (int j = 2; j <= n; ++j)
      for (int k = j + 1; k < n; ++k)
        ans += pref[j - 1][a[k]] * 1ll * suff[k + 1][a[j]];
    cout << ans << '\n';
  }
}
