#include <bits/stdc++.h>
using namespace std;
unsigned long long ct[3001][3001];
int main() {
  int t;
  cin >> t;
  for (int i = 0; i < t; i++) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
      ct[0][i] = 0;
    }
    ct[0][a[0]] = 1;
    for (int i = 1; i < n; i++) {
      for (int j = 1; j <= n; j++) {
        ct[i][j] = ct[i - 1][j];
      }
      ct[i][a[i]]++;
    }
    unsigned long long ans = 0;
    for (int i = 0; i < n; i++) {
      for (int j = i + 2; j < n; j++) {
        int x = a[i];
        int y = a[j];
        if (x == y) continue;
        ans += (ct[j - 1][x] - ct[i][x]) * (ct[j - 1][y] - ct[i][y]);
      }
    }
    for (int i = 1; i <= n; i++) {
      unsigned long long k = ct[n - 1][i];
      if (k >= 4) ans += (k * (k - 1) * (k - 2) * (k - 3)) / 24;
    }
    vector<unsigned long long> sum(n, 0);
    for (int i = 0; i < n; i++) {
      for (int j = 1; j <= n; j++) {
        sum[i] += (ct[i][j] * (ct[i][j] - 1)) / 2;
      }
    }
    for (int i = 2; i < n - 1; i++) {
      int x = a[i];
      unsigned long long k = ct[i - 1][x];
      unsigned long long temp =
          (sum[i - 1] - (k * (k - 1)) / 2) * (ct[n - 1][x] - ct[i][x]);
      ans = ans - temp;
    }
    cout << ans << endl;
  }
}
