# include<iostream>

# include<cstdio>

# include<vector>

# include<stack>

# include<cstring>

# include<algorithm>

using namespace std;

vector<int>v[1001];

int pos[1001];

stack<int>s;

int main()

{

    int n,a;

    while(~scanf("%d",&n))

    {

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

            scanf("%d",&a);

            v[i].clear();

            pos[a]=i;

        }

        while(!s.empty())

            s.pop();

        int root;

        scanf("%d",&root);

        s.push(root);

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

            scanf("%d",&a);

            while(1){

                int u=s.top();

                if(u==root||pos[u]+1<pos[a]){///pos[u]+1==pos[a]时，u和a为兄弟节点

                    v[u].push_back(a);

                    s.push(a);///深搜又加深了一层

                    break;///一旦找到a的父节点便找序列中的下一个节点的父节点

                }else

                    s.pop();

            }

        }

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

            printf("%d:",i);

            int l=v[i].size();

            for(int j=0;j<l;++j)

                printf(" %d",v[i][j]);

            printf("\n");

        }

    }

    return 0;

}