#include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 const int N = ;

 char buf[N];

 int next[N];

 void getNext(char *str, int len) {

     int i = , j = -;

     next[] = -;

     while (i <= len) {

         while (j > - && str[i] != str[j]) j = next[j];

         i++, j++;

         next[i] = j;

     }

 }

 typedef pair<int, int> PII;

 PII rec[N];

 int main() {

     int n, cas = ;

     while (cin >> n && n) {

         cin >> buf;

         getNext(buf, n);

 //        for (int i = 0; i <= n; i++) cout << next[i] << ' '; cout << endl;

         int cnt = ;

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

             if (i % (i - next[i])) continue;

             if (i / (i - next[i]) == ) continue;

             rec[cnt++] = PII(i, i / (i - next[i]));

         }

         sort(rec, rec + cnt);

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

         for (int i = ; i < cnt; i++) {

             printf("%d %d\n", rec[i].first, rec[i].second);

         }

         puts("");

     }

     return ;

 }