#include <cstdio>

 #include <queue>

 #include <cstring>

 #include <iostream>

 #include <cstdlib>

 #include <algorithm>

 #include <vector>

 #include <map>

 #include <set>

 #include <ctime>

 #include <cmath>

 #include <cctype>

 #define MAX 100000

 #define LL long long

 int cas=,T,n,f[MAX*+];

 char s[MAX*+];

 void getFail(char*s,int*f)

 {

     f[]=;f[]=;

     for(int i=;i<n;i++)

     {

         int j=f[i];

         if((j+)%(i-j)==&&s[i]==s[j]) printf("%d %d\n",i+,(i+)/(i-j));

         while(j&&s[i]!=s[j]) j=f[j];

         f[i+]=s[i]==s[j]?j+:;

     }

 }

 int main()

 {

     //freopen("/home/user/桌面/in","r",stdin);

     //scanf("%d\n",&T);

     while(scanf("%d",&n)==&&n)

     {

         scanf("%s",s);

         printf("Test case #%d\n",cas++);

         getFail(s,f);

         printf("\n");

     }

     //printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);

     return ;

 }