#include <bits/stdc++.h>
using namespace std;
namespace mine {
long long qread() {
  long long ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9') ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(long long num) {
  if (num < 0) putchar('-'), num = -num;
  if (num >= 10) write(num / 10);
  putchar('0' + num % 10);
}
void write1(long long num) {
  write(num);
  putchar(' ');
}
void write2(long long num) {
  write(num);
  putchar('\n');
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
bool IN(long long x, long long l, long long r) { return l <= x and x <= r; }
void GG() {
  puts("-1");
  exit(0);
}
const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T>
void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
long long qpower(long long x, long long e, int mod = MOD) {
  long long ans = 1;
  while (e) {
    if (e & 1) ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
long long invm(long long x) { return qpower(x, MOD - 2); }
const int MM = 5e6 + 10;
long long fac[MM], facinv[MM], Inv[MM];
long long Comb(int n, int m) {
  return n < 0 or n < m ? 0 : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
void PRE() {
  fac[0] = 1;
  for (int i = (1), I = (MM - 1); i <= I; i++) fac[i] = fac[i - 1] * i % MOD;
  facinv[MM - 1] = invm(fac[MM - 1]);
  for (int i = (MM - 1), I = (1); i >= I; i--)
    facinv[i - 1] = facinv[i] * i % MOD;
  Inv[1] = 1;
  for (int i = (2), I = (MM - 1); i <= I; i++)
    Inv[i] = (MOD - MOD / i) * Inv[MOD % i] % MOD;
}
const int N = 1e6 + 10;
int a[N], nxt[N], dp[N];
map<int, int> go[N];
void main() {
  for (int T = (1), I = (qread()); T <= I; T++) {
    int n = qread();
    for (int i = (1), I = (n); i <= I; i++) a[i] = qread(), go[i].clear();
    long long ans = 0;
    dp[n] = dp[n + 1] = 0, nxt[n] = n, go[n][a[n]] = n;
    for (int i = (n - 1), I = (1); i >= I; i--) {
      if (a[i] != a[i + 1]) {
        int j = (go[i + 1].count(a[i]) ? go[i + 1][a[i]] : n + 1);
        if (j <= n)
          assert(a[i] == a[j]), nxt[i] = j + 1;
        else
          nxt[i] = i;
      } else
        nxt[i] = i + 2;
      if (nxt[i] != i)
        dp[i] = dp[nxt[i]] + 1, go[i].swap(go[nxt[i]]);
      else
        dp[i] = 0;
      ans += dp[i];
      go[i][a[i]] = i;
    }
    write2(ans);
  }
}
};  // namespace mine
signed main() {
  srand(time(0));
  mine::PRE();
  mine::main();
  printf("");
}
