#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    double t[n], d[n];
    rep(i,n)cin >> t[i];
    rep(i,n)cin >> d[i];

    vector<pair<double,int>> v;
    rep(i,n){
        pair<double,int> p;
        p.first = d[i] / t[i];
        p.second = i + 1;
        v.push_back(p);
    }
    sort(v.begin(), v.end());

    rep(i,n){
        cout << v[i].second;
        if(i != n - 1)cout << ' ';
        else cout << endl;
    }
    return 0;
}