#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
#define pb push_back
const int N = 3000005;
bool cn[N];
vector <int> g[N], ans;
int n, x, k, p, kol, size[N];
void can(int v)
{
  int ws;
  for (int i = 0; i < g[v].size(); i++)
    if (g[v][i] != p)
    {
      ws = p;
      p = v;
      can(g[v][i]);
      p = ws;
      size[v] += size[g[v][i]];
    }
  size[v]++;
  if (size[v] == n / k)
  {
    size[v] = 0;
    kol++;
  }
}

int main()
{
  cin >> n;
  for (int i = 1; i < n; i++)
  {
    scanf("%d", &x);
    --x;
    g[x].pb(i);
    g[i].pb(x);
  }
  int i;
  for (i = 1; i * i <= n; i++)
    if (n % i == 0)
    {
      for (int j = 0; j < n; j++) size[j] = 0;
      kol = 0;
      k = i;
      p = -1;
      can(0);
      if (kol == i) cn[i] = true;

      for (int j = 0; j < n; j++) size[j] = 0;
      kol = 0;
      k = n / i ;
      p = -1;
      can(0);
      if (kol == n / i) cn[n / i] = true;
    }
  for (int i = 1; i <= n; i++)
    if (cn[i]) printf("%d ", i);
  return 0;
}