#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  assert(y >= 0);
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
int a[300135], nxt[300135];
map<int, int> mp[300135];
long long dp[300135];
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    scanf("%d", a + i);
  }
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    mp[i].clear();
  }
  nxt[n] = n + 1;
  for (int i = n - 1; i; i--) {
    if (a[i] == a[i + 1])
      nxt[i] = i + 1;
    else {
      auto it = mp[i + 1].find(a[i]);
      if (it == mp[i + 1].end())
        nxt[i] = n + 1;
      else
        nxt[i] = it->second;
    }
    if (nxt[i] >= n) continue;
    swap(mp[i], mp[nxt[i] + 1]);
    mp[i][a[nxt[i] + 1]] = nxt[i] + 1;
  }
  for (int(i) = 1; (i) <= (int)(n + 1); (i)++) dp[i] = 0;
  long long ans = 0;
  for (int i = n - 1; i; i--) {
    if (nxt[i] > n) continue;
    dp[i] = dp[nxt[i] + 1] + 1;
    ans += dp[i];
  }
  printf("%lld\n", ans);
}
int main() {
  int t = 1;
  scanf("%d", &t);
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
