CF

B. Resort

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Valera's finally decided to go on holiday! He packed up and headed for a ski resort.

Valera's fancied a ski trip but he soon realized that he could get lost in this new place. Somebody gave him a useful hint: the resort has n objects (we will consider the objects indexed in some way by integers from 1 to n), each object is either a hotel or a mountain.

Valera has also found out that the ski resort had multiple ski tracks. Specifically, for each object v, the resort has at most one object u, such that there is a ski track built from object u to object v. We also know that no hotel has got a ski track leading from the hotel to some object.

Valera is afraid of getting lost on the resort. So he wants you to come up with a path he would walk along. The path must consist of objects v₁, v₂, ..., v_k (k ≥ 1) and meet the following conditions:

1. Objects with numbers v₁, v₂, ..., v_k - 1 are mountains and the object with number v_k is the hotel.
2. For any integer i (1 ≤ i < k), there is exactly one ski track leading from object v_i. This track goes to object v_i + 1.
3. The path contains as many objects as possible (k is maximal).

Help Valera. Find such path that meets all the criteria of our hero!

Input

The first line contains integer n (1 ≤ n ≤ 10⁵) — the number of objects.

The second line contains n space-separated integers type₁, type₂, ..., type_n — the types of the objects. If type_i equals zero, then the i-th object is the mountain. If type_i equals one, then the i-th object is the hotel. It is guaranteed that at least one object is a hotel.

The third line of the input contains n space-separated integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ n) — the description of the ski tracks. If number a_i equals zero, then there is no such object v, that has a ski track built from v to i. If number a_i doesn't equal zero, that means that there is a track built from object a_i to object i.

Output

In the first line print k — the maximum possible path length for Valera. In the second line print k integers v₁, v₂, ..., v_k — the path. If there are multiple solutions, you can print any of them.

Sample test(s)

Input

5
0 0 0 0 1
0 1 2 3 4

Output

5
1 2 3 4 5

Input

5
0 0 1 0 1
0 1 2 2 4

Output

2
4 5

Input

4
1 0 0 0
2 3 4 2

Output

1
1
//nimeidebingchajia
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<algorithm>
#define maxn 100005
using namespace std;

int n;
int hot[maxn],du[maxn];
int pre[maxn];
int len[maxn];
int t;
int p[maxn];
void init()
{
    for(int i=0;i<maxn;i++)
       pre[i]=i;
    memset(hot,0,sizeof(hot));
    memset(du,0,sizeof(du));
    memset(len,0,sizeof(len));
}

int c;

int find(int x, int s)
{
    if(x==pre[x])
    {
        if(du[x]==1)return s+1;
        else return s;
    }
    else
    {
        if(du[x]==1)return find(pre[x],s+1);
        else return s;
    }
}

void print(int x)
{
    if(du[x]==1)
    {
        p[t++]=x;
        if(x==pre[x])return;
        print(pre[x]);
    }
}

void solve()
{
    for(int i=1;i<=n;i++)
    {
        if(hot[i])
        {
            len[i]=find(pre[i],1);
        }
    }
    int max=-1,k=0;
    for(int i=1;i<=n;i++)
    {
        if(len[i]>max)
        {
            max=len[i];
            k=i;
        }
    }
    cout<<len[k]<<endl;
    t=0;
    p[t++]=k;
    print(pre[k]);
    for(int i=t-1;i>=0;i--)
    cout<<p[i]<<" ";
    cout<<endl;
}

void input()
{
    while(cin>>n)
    {
        init();
        for(int i=1;i<=n;i++)
        {
            cin>>c;
            hot[i]=c;
        }
        for(int i=1;i<=n;i++)
        {
            cin>>c;
            if(c==0);
            else
            {
                du[c]++;
                pre[i]=c;
            }
        }
        solve();
    }
}

int main()
{
    input();
    return 0;
}