Untitled

#include <iostream> 
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <iomanip>
using namespace std;

#define ll long long
#define pb push_back
#define db double
#define make make_pair
#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(NULL);

int main() {
    speed;
    vector <pair<int, int>> v;
    int n;
    cin >> n;
    v.pb({ 0,0 });
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        v.pb({ x,0 });
    }
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        v[i].second = x;
    }

    for (int i = 1; i <= n; i++) {
        if (v[i].first > v[i].second) {
            swap(v[i].first, v[i].second);
        }
    }

    sort(v.begin(), v.end());

    for (int i = 2; i <= n; i++) {
        if (v[i].second < v[i - 1].second) {
            cout << -1;
            exit(0);
        }
    }

    for (int i = 1; i <= n; i++) cout << v[i].first << ' ';
    cout << "\n";
    for (int i = 1; i <= n; i++) cout << v[i].second << ' ';

    return 0;
}