#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int myrand() { return abs((int)mt()); }
void chemthan() {
  int n;
  cin >> n;
  vector<int> b(n - 1), c(n - 1);
  vector<pair<int, int> > vals;
  vector<int> dc;
  for (int i = (0); i < (n - 1); ++i) cin >> b[i], dc.push_back(b[i]);
  for (int i = (0); i < (n - 1); ++i) cin >> c[i], dc.push_back(c[i]);
  sort((dc).begin(), (dc).end()),
      (dc).erase(unique((dc).begin(), (dc).end()), (dc).end());
  for (int i = (0); i < (n - 1); ++i) {
    b[i] = lower_bound((dc).begin(), (dc).end(), b[i]) - dc.begin();
    c[i] = lower_bound((dc).begin(), (dc).end(), c[i]) - dc.begin();
    vals.push_back(make_pair(b[i], c[i]));
  }
  sort((vals).begin(), (vals).end());
  if (n == 2) {
    if (b[0] > c[0]) {
      cout << -1 << "\n";
    } else {
      cout << dc[b[0]] << " " << dc[c[0]] << "\n";
    }
    return;
  }
  int K = int((dc).size());
  vector<vector<int> > adj(K);
  map<pair<int, int>, int> hs;
  vector<int> f(K);
  for (int i = (0); i < (n - 1); ++i) {
    if (b[i] ^ c[i]) {
      adj[b[i]].push_back(c[i]);
      adj[c[i]].push_back(b[i]);
      hs[make_pair(b[i], c[i])]++;
      hs[make_pair(c[i], b[i])]++;
    } else {
      f[b[i]]++;
    }
  }
  vector<int> ver;
  for (int i = (0); i < (K); ++i) {
    auto e = adj[i];
    int total = 0;
    for (int v : e) {
      total ^= hs[make_pair(i, v)] & 1;
    }
    if (total) {
      ver.push_back(i);
    }
  }
  if (1 < int((hs).size()) && (int((ver).size()) ^ 2) && int((ver).size())) {
    cout << -1 << "\n";
    return;
  }
  sort((ver).begin(), (ver).end());
  if (int((ver).size()) == 0) {
    ver.push_back(b[0]);
  }
  stack<int> stk;
  vector<int> path;
  function<void(int)> find_path = [&](int u) {
    stk.push(u);
    while (int((adj[u]).size())) {
      int v = adj[u].back();
      adj[u].pop_back();
      if (hs[make_pair(u, v)]) {
        hs[make_pair(u, v)]--;
        hs[make_pair(v, u)]--;
        find_path(v);
      }
    }
    int x = stk.top();
    for (int i = (0); i < (f[x] + 1); ++i) {
      path.push_back(x);
    }
    f[x] = 0;
    stk.pop();
  };
  find_path(ver[0]);
  for (int it = (0); it < (2); ++it) {
    vector<pair<int, int> > vals2;
    for (int i = (0); i < (int((path).size()) - 1); ++i) {
      int u = min(path[i], path[i + 1]);
      int v = max(path[i], path[i + 1]);
      vals2.push_back(make_pair(u, v));
    }
    sort((vals2).begin(), (vals2).end());
    if (vals == vals2) {
      for (int i = (0); i < (int((path).size())); ++i)
        cout << dc[path[i]] << " \n"[i == int((path).size()) - 1];
      return;
    }
    reverse((path).begin(), (path).end());
  }
  cout << -1 << "\n";
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  chemthan();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
