#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
const int mx = 3e5 + 5;
int n;
int p[mx], q[mx], rev[mx];
int tree[mx * 4], prop[mx * 4];
void shift(int node) {
  tree[2 * node] += prop[node];
  tree[2 * node + 1] += prop[node];
  prop[2 * node] += prop[node];
  prop[2 * node + 1] += prop[node];
  prop[node] = 0;
}
void update(int node, int l, int r, int b, int e, int x) {
  if (l > e || r < b) return;
  if (l >= b && r <= e) {
    tree[node] += x;
    prop[node] += x;
    return;
  }
  shift(node);
  int mid = (l + r) / 2;
  update(2 * node, l, mid, b, e, x);
  update(2 * node + 1, mid + 1, r, b, e, x);
  tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> p[i];
    rev[p[i]] = i;
  }
  int ans = n;
  update(1, 1, n, 1, rev[n], 1);
  for (int i = 1; i <= n; ++i) {
    while (tree[1] <= 0) update(1, 1, n, 1, rev[--ans], 1);
    cout << ans << " ";
    cin >> q[i];
    update(1, 1, n, 1, q[i], -1);
  }
  cout << '\n';
}
