#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

#define MOD 10007
#define N 210000

char M[N];
int Next[N], dp[N];

void FindNext(int len)
{
    int i=0, j=-1;
    Next[0] = -1;

    while(i<len)
    {
        if(j==-1 || M[i]==M[j])
            Next[++i] = ++j;
        else
            j = Next[j];
    }
}

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int n, i, Sum=0;
        memset(dp, 0, sizeof(dp));

        scanf("%d%s", &n, M);

        FindNext(n);
        for(i=1; i<=n; i++)
        {
            dp[i] = (dp[Next[i]] + 1)%MOD;
            Sum = (dp[i]+Sum)%MOD;
        }

        printf("%d\n", Sum);
    }
    return 0;
}