#include<cstdio>

#include<algorithm>

#include<vector>

#include<cstring>

using namespace std;

const int MAXN =  * 1e6;

inline int read() {

    char c = getchar(); int x = , f = ;

    while(c < '' || c > '') {if(c == '-') f = -; c = getchar();}

    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();

    return x * f;

}

int N;

vector<int> ap;

int fa[MAXN], tim[MAXN];

void rebuild() {

    memset(tim, , sizeof(tim));

   // for(int i = 1; i <= N; i++) v[i].clear();

    for(int i = ; i <= N; i++) fa[i] = (fa[i] + ) % (i - ) + ;

}

int siz[MAXN];

/*void dfs(int x, int fa) { mdzz卡dfs，不愧是SDOI啊。。

    siz[x] = 1;

    for(int i = 0; i < v[x].size(); i++) {

        int to = v[x][i];

        if(to == fa) continue;

        dfs(to, x);

        siz[x] += siz[to];

    }

}*/

void solve(int id) {

    printf("Case #%d:\n", id);

    for(int i = ; i <= N; i++) siz[i] = ;

    for(int i = N; i >= ; i--) siz[fa[i]] += siz[i];

    for(int i = ; i <= N; i++) tim[siz[i]]++;

    for(int i = ; i < ap.size(); i++) {

        int num = ap[i], cnt = ;

        for(int j = num; j <= N; j += num)

            cnt += tim[j];

        if(cnt >= N / num) {

            printf("%d\n", num);

        }

    }

}

int main() {

    N = read();

    for(int i = ; i <= N; i++)

        if(N % i == )

            ap.push_back(i);

    for(int i = ; i <= N; i++)

        fa[i] = read();

    solve();

    for(int i = ; i <= ; i++) {

        rebuild();

        solve(i);

    }

    return ;

}