#include <bits/stdc++.h>
using namespace std;
template <typename T>
void unique(T &c) {
  c.erase(std::unique(c.begin(), c.end()), c.end());
}
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec) is >> v;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  for (int i = 0; i < vec.size(); i++) {
    os << vec[i];
    if (i + 1 != vec.size()) os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end()) os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end()) os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end()) os << " ";
  }
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
  for (auto itr = st.begin(); itr != st.end(); ++itr) {
    os << *itr;
    auto titr = itr;
    if (++titr != st.end()) os << " ";
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
  for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    os << "(" << itr->first << ", " << itr->second << ")";
    auto titr = itr;
    if (++titr != mp.end()) os << " ";
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
  for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
    os << "(" << itr->first << ", " << itr->second << ")";
    auto titr = itr;
    if (++titr != mp.end()) os << " ";
  }
  return os;
}
using ll = long long int;
using P = pair<int, int>;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
struct fast_io {
  fast_io() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
  }
} fast_io_;
template <typename Monoid>
class LazySegmentTree {
 public:
  using T = typename Monoid::value_type;
  using E = typename Monoid::lazy_type;
  int n;
  T identity;
  E lazy_def;
  vector<T> val;
  vector<E> lazy;
  LazySegmentTree() {}
  LazySegmentTree(int n_, vector<T> v = vector<T>()) {
    identity = Monoid::identity;
    lazy_def = Monoid::lazy_def;
    n = 1;
    while (n < n_) n *= 2;
    val.assign(2 * n - 1, identity);
    lazy.assign(2 * n - 1, lazy_def);
    for (size_t i = 0; i < v.size(); i++) {
      val[i + n - 1] = v[i];
    }
    for (int i = n - 2; i >= 0; i--) {
      val[i] = Monoid::operation(val[2 * i + 1], val[2 * i + 2]);
    }
  }
  void eval(int k, int len) {
    if (lazy[k] == lazy_def) return;
    if (k < n - 1) {
      lazy[2 * k + 1] = Monoid::lazy_accumulate(lazy[2 * k + 1], lazy[k]);
      lazy[2 * k + 2] = Monoid::lazy_accumulate(lazy[2 * k + 2], lazy[k]);
    }
    val[k] = Monoid::lazy_update(val[k], lazy[k], len);
    lazy[k] = lazy_def;
  }
  T update(int a, int b, E &e, int k, int l, int r) {
    eval(k, r - l);
    if (r <= a || b <= l)
      return val[k];
    else if (a <= l && r <= b) {
      lazy[k] = Monoid::lazy_accumulate(lazy[k], e);
      eval(k, r - l);
      return val[k];
    } else {
      T lv = update(a, b, e, 2 * k + 1, l, (l + r) / 2);
      T rv = update(a, b, e, 2 * k + 2, (l + r) / 2, r);
      return val[k] = Monoid::operation(lv, rv);
    }
  }
  T update(int a, int b, E e) { return update(a, b, e, 0, 0, n); }
  T query(int a, int b, int k, int l, int r) {
    eval(k, r - l);
    if (r <= a || b <= l) return identity;
    if (a <= l && r <= b) return val[k];
    T lv = query(a, b, 2 * k + 1, l, (l + r) / 2);
    T rv = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return Monoid::operation(lv, rv);
  }
  T query(int a, int b) { return query(a, b, 0, 0, n); }
  T get(int i) { return query(i, i + 1); }
};
template <typename T, typename E>
class RMQRAQ {
 public:
  using value_type = T;
  using lazy_type = E;
  const static T identity;
  const static E lazy_def;
  RMQRAQ() {}
  static T operation(T &l, T &r) { return min(l, r); }
  static E lazy_accumulate(E &l, E &r) { return l + r; }
  static T lazy_update(T &t, E &e, int len) { return t + e; }
};
template <typename T, typename E>
const T RMQRAQ<T, E>::identity = inf;
template <typename T, typename E>
const E RMQRAQ<T, E>::lazy_def = 0;
template <class Monoid>
class SegmentTree {
 public:
  int n;
  using T = typename Monoid::value_type;
  vector<T> val;
  T identity;
  SegmentTree() {}
  SegmentTree(int n_, vector<T> v = vector<T>()) {
    n = 1;
    while (n < n_) n *= 2;
    identity = Monoid::identity;
    val.assign(2 * n - 1, identity);
    for (size_t i = 0; i < v.size(); i++) {
      val[i + n - 1] = v[i];
    }
    for (int i = n - 2; i >= 0; i--) {
      val[i] = Monoid::operation(val[2 * i + 1], val[2 * i + 2]);
    }
  }
  void update(int k, const T &t) {
    k = k + n - 1;
    val[k] = t;
    while (k > 0) {
      k = (k - 1) / 2;
      val[k] = Monoid::operation(val[2 * k + 1], val[2 * k + 2]);
    }
  }
  T query(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return identity;
    if (a <= l && r <= b) return val[k];
    T lv = query(a, b, 2 * k + 1, l, (l + r) / 2);
    T rv = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return Monoid::operation(lv, rv);
  }
  T query(int a, int b) { return query(a, b, 0, 0, n); }
  T get(int i) { return val[i + n - 1]; }
};
template <typename T>
class RSQ {
 public:
  const static T identity;
  using value_type = T;
  RSQ() {}
  static T operation(T &l, T &r) { return l + r; }
};
template <typename T>
const T RSQ<T>::identity = 0;
int main(int argc, char const *argv[]) {
  int n;
  cin >> n;
  vector<int> p(n);
  cin >> p;
  for (int i = (0); i < (n); ++i) p[i]--;
  vector<int> q(n);
  cin >> q;
  for (int i = (0); i < (n); ++i) q[i]--;
  vector<int> tr(n);
  for (int i = (0); i < (n); ++i) tr[p[i]] = i;
  vector<int> res(n, 0);
  LazySegmentTree<RMQRAQ<int, int>> seg(n, vector<int>(n, 3 * n));
  SegmentTree<RSQ<int>> cnt(n);
  SegmentTree<RSQ<int>> bomb(n);
  for (int i = (0); i < (n); ++i) {
    int nex = (i == 0 ? n - 1 : res[i - 1]);
    while (nex > 0) {
      seg.update(0, tr[nex] + 1, -1);
      int mini = seg.query(0, n);
      if (mini < 0) {
        seg.update(0, tr[nex] + 1, 1);
        break;
      }
      if (bomb.query(tr[nex], n) - cnt.query(tr[nex], n) - 1 >= 0) {
        int nev = seg.query(tr[nex], tr[nex] + 1);
        cnt.update(tr[nex], 1);
        seg.update(tr[nex], tr[nex] + 1,
                   -nev + bomb.query(tr[nex], n) - cnt.query(tr[nex], n));
        nex--;
      } else {
        seg.update(0, tr[nex] + 1, 1);
        break;
      }
    }
    res[i] = nex;
    bomb.update(q[i], 1);
    seg.update(0, q[i] + 1, 1);
  }
  for (int i = (0); i < (n); ++i) res[i]++;
  cout << res << endl;
  return 0;
}
