#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <vector>

 using namespace std;

 const int maxn =  + ;

 const int MOD = ;

 int n;

 vector<int> G[maxn], pre[maxn], suf[maxn];

 void scan(int& x)

 {

     x = ;

     char c = ' ';

     while(c < '' || c > '') c = getchar();

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

 }

 int d[maxn], f[maxn];

 void mul(int& x, int y) { x = 1LL * x * y % MOD; }

 void dfs(int u)

 {

     d[u] = ;

     int sz = G[u].size();

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

     {

         int v = G[u][i];

         dfs(v);

         mul(d[u], d[v] + );

     }

     int p = , s = ;

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

     {

         mul(p, d[G[u][i]] + );

         mul(s, d[G[u][sz--i]] + );

         pre[u].push_back(p);

         suf[u].push_back(s);

     }

     reverse(suf[u].begin(), suf[u].end());

 }

 void dfs2(int u)

 {

     int sz = G[u].size();

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

     {

         int v = G[u][i];

         f[v] = f[u];

         if(i > ) mul(f[v], pre[u][i - ]);

         if(i < sz - ) mul(f[v], suf[u][i + ]);

         f[v]++;

         if(f[v] >= MOD) f[v] -= MOD;

         dfs2(v);

     }

 }

 int main()

 {

     scanf("%d", &n);

     for(int x, i = ; i <= n; i++)

     {

         scan(x);

         G[x].push_back(i);

     }

     dfs();

     f[] = ;

     dfs2();

     for(int i = ; i <= n; i++) printf("%I64d ", 1LL * d[i] * f[i] % MOD);

     return ;

 }