#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (auto &i : v) {
    cin >> i;
    i--;
  }
  vector<vector<int> > pref(n, vector<int>(n, 0));
  vector<vector<int> > suff(n, vector<int>(n, 0));
  for (int val = 0; val < n; val++) {
    pref[val][0] = v[0] == val;
    for (int i = 1; i < n; i++) pref[val][i] = pref[val][i - 1] + (v[i] == val);
    suff[val][n - 1] = v[n - 1] == val;
    for (int i = n - 2; i >= 0; i--)
      suff[val][i] = suff[val][i + 1] + (v[i] == val);
  }
  long long res = 0;
  for (int j = 1; j + 3 <= n; j++)
    for (int k = j + 1; k + 2 <= n; k++) {
      res += (long long)pref[v[k]][j - 1] * suff[v[j]][k + 1];
    }
  cout << res << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  int t;
  cin >> t;
  while (t--) solve();
}
