#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef complex<double> P;
typedef pair<int,int> pii;
#define REP(i,n) for(ll i=0;i<n;++i)
#define REPR(i,n) for(ll i=1;i<n;++i)
#define FOR(i,a,b) for(ll i=a;i<b;++i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define MOD (ll)(1e9+7)
#define ADD(a,b) a=((a)+(b))%MOD
#define FIX(a) ((a)%MOD+MOD)%MOD

int main(){
  ll n;
  cin >> n;
  vl t(n),d(n);
  REP(i,n) cin>>t[i];
  REP(i,n) cin>>d[i];
  // maximize sigma_{i=0}^{n-1} sigma_{j=i+1}^{n-1} t[i]*d[j]
  vector< pair<double,int> > a(n);
  REP(i,n){
    a[i] = make_pair((double)d[i]/(double)t[i],i+1);
  }
  sort(ALL(a));
  cout << a[0].second;
  REPR(i,n){
    cout << " " << a[i].second;
  }
  cout << endl;
  return 0;
}