#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef long double ld;
vector <ld> a;
vector <ld> b;
vector <ld> p;
bool cmp(ld i, ld j){
    ld l, m;
    m = min(b.at(i), b.at(j) - a.at(i));
    l = min(b.at(j), b.at(i) - a.at(j));
    return l >= m;
}
int main() {
    ll n;
    ld x;
    cin >> n;
    a.resize(n);
    b.resize(n);
    p.resize(n);
    for (ll i = 0; i < n; i++){
        p.at(i) = i;
    }
    ld sum = 0;
    for (ll i = 0; i < n; i++){
        cin >> x;
        a.at(i) = x;
        sum += x;
    }
    for (ll i = 0; i < n; i++){
        cin >> x;
        b.at(i) = x;
    }
    ld s = 0;
    sort(p.begin(), p.end(), cmp);
    for (ll i = 0; i < n; i++){
        s += a.at(p.at(i));
        if (b.at(p.at(i)) >= sum - s + 1)
            continue;
        else{
            cout << - 1;
            return 0;
        }
    }
    for (int i = 0; i < n; i++)
        cout << p.at(i) + 1 << ' ';
    return 0;
}