#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;

const int mo=10007;
int n,T,dp[200010],p[200010],Ans;
char s[200010]; 

int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d\n%s",&n,s+1);Ans=0;
		memset(p,0,sizeof(p));
		memset(dp,0,sizeof(dp));
		for(int i=2,j=0;i<=n;++i){
			while(j>0&&s[i]!=s[j+1]) j=p[j];
			if(s[i]==s[j+1]) ++j;
			p[i]=j;
		}
		for(int i=1;i<=n;++i) Ans=(Ans+(dp[i]=dp[p[i]]+1))%mo;
		printf("%d\n",Ans);
	}
	return 0;
}