1961

/*
KMP算法思想
*/

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>
#include <strstream>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef long long LL;
typedef unsigned long long ULL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define FORi(a,b,c) for(int i=(a);i<(b);i+=c)
#define FORj(a,b,c) for(int j=(a);j<(b);j+=c)
#define FORk(a,b,c) for(int k=(a);k<(b);k+=c)
#define FORp(a,b,c) for(int p=(a);p<(b);p+=c)

#define FF(i,a)    for(int i=0;i<(a);i+++)
#define FFD(i,a)   for(int i=(a)-1;i>=0;i--)
#define Z(a) (a<<1)
#define Y(a) (a>>1)

const double eps = 1e-6;
const double INFf = 1e10;
const int INFi = 1000000000;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}


// code begin
#define MAXN 1000010
int Ps;
char P[MAXN];
int next[MAXN];

void CalNext()
{
	next[0] = 0;
	next[1] = 0;
	int j;

	FORi(2,Ps+1,1)
	{
		j = next[i-1];
		while(true)
		{
			if( P[j]==P[i-1])
			{
				next[i] = j+1;
				break;
			}
			if(j==0)
			{
				next[i] = 0;
				break;
			}
			j = next[j];
		}
	}
}
int main()
{
	read;
	write;
	int cas=1;
	while(scanf("%d",&Ps)!=-1)
	{
		if(Ps==0) break;

		scanf("%s",P);
		CalNext();

		printf("Test case #%d\n",cas++);
		FORi(2,Ps+1,1)
		{
			if( i%(i-next[i])==0 && i/(i-next[i])>1 )
			{
				printf("%d %d\n",i,i/(i-next[i]));
			}
		}
		printf("\n");
	}
	return 0;	
}