#include<stdio.h>
#include<string.h>
#define N 1000007

char S[N];
int Next[N];

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

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


int main()
{
    int n, iCase=1;

    while(scanf("%d", &n), n)
    {
        int i;

        scanf("%s", S);
        FindNext(n);

        printf("Test case #%d\n", iCase++);
        for(i=2; i<=n; i++)
        {
            if(i%(i-Next[i])==0 && Next[i])  ///这里是个坑，当Next[i]==0的时候虽然满足前面的条件，但是它的前缀和后缀的最大匹配度是0
                printf("%d %d\n", i, i/(i-Next[i]));
        }

        printf("\n");
    }
    return 0;
}