KMP
#include <bits/stdc++.h>
#define INF (int)(1e9)
#define maxn 1000010
#define sigma_size 100
using namespace std;
char str[maxn];
int f[maxn];
void GetNext(char *p) {
int m = strlen(p);
f[0] = f[1] = 0;
for (int i = 1; i < m; ++ i) {
int j = f[i];
while (j && p[i] != p[j]) j = f[j];
f[i+1] = p[i] == p[j] ? j+1 : 0;
}
}
int main() {
#ifdef LOCAL
freopen("data.in", "r", stdin);
#endif // LOCAL
int n, now = 0;
while (scanf("%d", &n) != EOF) {
if (n == 0) break;
scanf("%s", str);
GetNext(str);
printf("Test case #%d\n", ++ now);
for (int i = 2; i <= n; ++ i) {
if (f[i] > 0 && i%(i-f[i]) == 0) cout << i << " " << i/(i-f[i]) << endl;
}
puts("");
}
}