#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
int main(){
	int N;
	cin >> N;
	vector<int> T(N);
	for (int i = 0; i < N; i++){
		cin >> T[i];
	}
	vector<int> D(N);
	for (int i = 0; i < N; i++){
		cin >> D[i];
	}
	vector<pair<double, int>> P(N);
	for (int i = 0; i < N; i++){
		P[i] = make_pair((double) T[i] / D[i], i + 1);
	}
	sort(P.begin(), P.end());
	reverse(P.begin(), P.end());
	for (int i = 0; i < N; i++){
		cout << P[i].second + 1;
		if (i < N - 1){
			cout << ' ';
		}
	}
	cout << endl;
}