#include <bits/stdc++.h>   using namespace std;   template <typename T>   inline bool inrange(T a, T l, T r) {     if (l > r) swap(l, r);     return (a >= l and a <= r);   }   template <typename T, typename U>   inline bool exist(T val, U &any) {     return (any.find(val) != any.end());   }   template <typename T>   inline void inp(T &any) {     cin >> any;   }   template <typename T, typename... U>   inline void inp(T &a, U &...b) {     cin >> a;     inp(b...);   }   template <typename T>   inline istream &operator>>(istream &in, vector<T> &a) {     for (auto &x : a) in >> x;     return in;   }   template <typename T, typename U>   inline istream &operator>>(istream &in, pair<T, U> &a) {     in >> a.first >> a.second;     return in;   }   void solve(long long int &T) {     long long int n;     std::cin >> n;     vector<long long int> a(n), b(n);     std::cin >> a >> b;     vector<long long int> sol(n);     for (long long int i = (0); i < (n); i++) sol[a[i] - 1] = b[i];     for (auto &X : sol) std::cout << X <<    ;     std::cout <<   n ;   }   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     ;     int t = 1;     for (long long int i = (1); i < (t + 1); i++) {       cerr <<  Case #  << i <<   n ;       solve(i);     }     return 0;   }   