#include <cstdio>
#include <stack>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <functional>
#include <cstring>
#include <algorithm>
#include <cctype>
#include <ctime>
#include <cstdlib>
#include <fstream>
#include <string>
#include <sstream>
#include <map>
#include <cmath>
#define LL long long
#define lowbit(x) ((x) & (-x))
#define MP(a, b) make_pair(a, b)
#define MS(arr, num) memset(arr, num, sizeof(arr))
#define PB push_back
#define F first
#define S second
#define ROP freopen("input.txt", "r", stdin);
#define BitCount(x) __builtin_popcount(x)
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const int MAXN = 1e6 + 5;
const int MOD = 20071027;
 
typedef pair<int, int> pii;
typedef vector<int>::iterator viti;
typedef vector<pii>::iterator vitii;
 
char str[MAXN];
int len, f[MAXN];
 
vector<int> ans;
 
void GetFail()
{
    f[0] = f[1] = 0;
    for (int i = 1; i < len; i++)
    {
        int j = f[i];
        while (j && str[j] != str[i]) j = f[j];
        f[i + 1] = (str[j] == str[i] ? j + 1 : 0);
    }
}
 
int main()
{
    //ROP;
    int n, i, j, cases = 0;
    while (scanf("%d", &n), n)
    {
        scanf("%s", str);
        len = strlen(str);
        GetFail();
        printf("Test case #%d\n", ++cases);
        for (i = 2; i <= len; i++)
        {
            if (f[i] && i % (i - f[i]) == 0)
                printf("%d %d\n", i, i / (i - f[i]));
        }
        puts("");
    }
    return 0;
}