#include<iostream>

#include<cstdio>

#include<queue>

#include<algorithm>

#include<cmath>

#include<ctime>

#include<set>

#include<map>

#include<stack>

#include<cstring>

#define inf 2147483647

#define ls rt<<1

#define rs rt<<1|1

#define lson ls,nl,mid,l,r

#define rson rs,mid+1,nr,l,r

#define N 1000010

#define For(i,a,b) for(int i=a;i<=b;i++)

#define p(a) putchar(a)

#define g() getchar()

using namespace std;

int kmp[N];

int n,k;

char a[N];

int cnt;

void in(int &x){

    int y=;

    char c=g();x=;

    while(c<''||c>''){

        if(c=='-')y=-;

        c=g();

    }

    while(c<=''&&c>=''){

        x=(x<<)+(x<<)+c-'';c=g();

    }

    x*=y;

}

void o(int x){

    if(x<){

        p('-');

        x=-x;

    }

    if(x>)o(x/);

    p(x%+'');

}

void clear(){

    memset(kmp,,sizeof(kmp));

    k=;

}

int main(){

    while(cin>>n&&n){

        clear();

        cin>>(a+);

        For(i,,n){

            while(k&&a[i]!=a[k+])

                k=kmp[k];

            if(a[k+]==a[i])

                k++;

            kmp[i]=k;

        }

    cout<<"Test case #"<<++cnt<<endl;

    For(i,,n)

        if(kmp[i]>&&i%(i-kmp[i])==){

            o(i);p(' ');o(i/(i-kmp[i]));p('\n');

        }

    p('\n');

    }

    return ;

}