注意用的数组
// int a[N];
// int id[N];
// int q[N];
// a[i] = id[q[i]];
#include <bits/stdc++.h>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#define IO (ios::sync_with_stdio(false),cin.tie(0),cout.tie(0))
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=a;i>=n;i--)
#define fors(i,a,b) for(int i = a; i < b; ++i)
#define debug(x) cerr<<#x<<" = "<<x<<endl
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod = 1e9+7;
const int N = 1e2+10;
ll res, ans, cnt;
int n, m;
int a[N], id[N], q[N];
int main()
{
cin >> n;
rep(i, 1, n) cin >> q[i];
rep(i, 1, n) cin >> id[i];
rep(i, 1, 3)
{
rep(i, 1, n)
a[i] = id[q[i]];
memcpy(id, a, sizeof id);
}
rep(i, 1, n) cout << id[i] << endl;
return 0;
}