#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<pair<pii, int> > P(N);
    for (int i = 0; i < N; i++) {
        cin >> P[i].first.first;
    }
    for (int i = 0; i < N; i++) {
        cin >> P[i].first.second;
    }
    for (int i = 0; i < N; i++) P[i].second = i;
    sort(P.begin(), P.end(), [](const pair<pii, int>& lhs, const pair<pii, int>& rhs) {return lhs.first.first*rhs.first.second > lhs.first.second*rhs.first.first;});
    for (int i = 0; i < N; i++) {
        cout << P[i].second+1 ;
        if (i < N-1) cout << " ";
    }
    cout << endl;
    return 0;
}