//KZNS
#include <fstream>
using namespace std;
//
ifstream fin ("dividec.in");
ofstream fout ("dividec.out");
const int Nmax = 1200003;
//
int N;
int fa[Nmax] = {0};
int cts[Nmax] = {0};
int uts[Nmax] = {0};
bool fff;
//
int main() {
	fin >> N;
	fa[1] = 0;
	fin >> fa[2];
	char c;
	for (int i = 3; i <= N; i++)
		fin >> c >> fa[i];
	/////#1
	fout << "Case #1:" << endl;
	for (int i = 1; i <= N; i++)
		cts[i] = 1;
	for (int i = N; i > 1; i--)
		cts[fa[i]] += cts[i];
	for (int i = 1; i <= N; i++) {
		if (N%i==0) {
			fff = true;
			for (int j = 1; j <= N; j++)
				uts[j] = cts[j];
			for (int j = N; j > 1; j--) {
				if (uts[j] == i) {
					uts[fa[j]] -=cts[j];
				}
				else {
					if (uts[j] > i) {
						fff = false;
						continue;
					}
				}
			}
			fout << i <<endl;
		}
	}
	/////////
	for (int k = 2; k <= 10; k++) {
		for (int i = 2; i <= N; i++) {
			fa[i] = (fa[i]+19940105)%(i-1) + 1;
		}
		fout << "Case #"  << k << ":" << endl;
		for (int i = 1; i <= N; i++)
			cts[i] = 1;
		for (int i = N; i > 1; i--)
			cts[fa[i]] += cts[i];
		for (int i = 1; i <= N; i++) {
			if (N%i==0) {
				fff = true;
				for (int j = 1; j <= N; j++)
					uts[j] = cts[j];
				for (int j = N; j > 1; j--) {
					uts[fa[j]] -= cts[j]-uts[j];
					if (uts[j] == i) {
						uts[fa[j]] -=uts[j];
					}
					else {
						if (uts[j] > i) {
							fff = false;
							continue;
						}
					}
				}
				if (fff)
					fout << i <<endl;
			}
		}
	}
	return 0;
}
//UBWH