#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    int N;
    cin >> N;
    vector<int> T(N), D(N), idx(N);
    for(int i = 0; i < N; ++i)  cin >> T[i];
    for(int i = 0; i < N; ++i)  cin >> D[i];
    for(int i = 0; i < N; ++i)  idx[i] = i;

    sort(begin(idx), end(idx), [&](const int& i, const int& j){
        return T[i] * D[j] > T[j] * D[i];
    });
    
    for(int i = 0; i < N; ++i){
        cout << idx[i] + 1 << (i == N - 1 ? '\n' : ' ');
    }
    
    return 0;
}