rt

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
int read(){
	int p=0;char ch=getchar();
	while(ch<'0'||ch>'9') ch=getchar();
	while(ch>='0'&&ch<='9') p=(p<<1)+(p<<3)+ch-'0',ch=getchar();
	return p; 
}
int n,_;
int f[300005],p[300005];
int s[300005];
int main(){
//	freopen("shuru.in","r",stdin);
//	freopen("fuck.out","w",stdout);
	_=read();
	while(_--){
		for(int i=1;i<=n;i++) f[i]=0;
		n=read();
		for(int i=1;i<=n;i++) s[i]=read();
		for(int i=2;i<=n;i++){
			if(s[i]==s[i-1]){
				p[i]=i-1;
				continue;
			}
			int now=p[i-1];
			while(now&&s[now-1]!=s[i]){
				now=p[now-1];
			}
			p[i]=now-1;
			if(p[i]<1) p[i]=0;
		}
		//for(int i=1;i<=n;i++) printf("%d ",p[i]);
		for(int i=1;i<=n;i++){
			if(p[i]!=0){
				f[i]=f[p[i]-1]+1;
			}
		}
		ll ans=0;
		for(int i=1;i<=n;i++) ans+=f[i];
		printf("%lld\n",ans);
	}
	return 0;
}