/*
ID: LinKArftc
PROG: 3336.cpp
LANG: C++
*/

#include <map>
#include <set>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <cstdio>
#include <string>
#include <utility>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define eps 1e-8
#define randin srand((unsigned int)time(NULL))
#define input freopen("input.txt","r",stdin)
#define debug(s) cout << "s = " << s << endl;
#define outstars cout << "*************" << endl;
const double PI = acos(-1.0);
const double e = exp(1.0);
const int inf = 0x3f3f3f3f;
const int INF = 0x7fffffff;
typedef long long ll;

const int maxn = 200010;
const int MOD = 10007;
int dp[maxn];
char str[maxn];
int Next[maxn];

void getNext(char *p) {
    int i = 0, j = -1;
    int len = strlen(p);
    Next[0] = -1;
    while (i < len) {
        if (j == -1 || p[i] == p[j]) {
            i ++; j ++;
            Next[i] = j;
        } else j = Next[j];
    }
}

int main() {
    int T, n;
    scanf("%d", &T);
    while (T --) {
        scanf("%d", &n);
        scanf("%s", str);
        getNext(str);
        dp[0] = 0;
        int ans = 0;
        for (int i = 1; i <= n; i ++) {
            dp[i] = (dp[Next[i]] + 1) % MOD;
            ans = (dp[i] + ans) % MOD;
        }
        printf("%d\n",ans);
    }
    return 0;
}