#include <bits/stdc++.h>
#include <atcoder/scc>
#define all(x) x.begin(), x.end()
using namespace std;
using namespace atcoder;
using ll = long long;


vector<vector<int> > convert_SCC_to_DAG(int n, vector<ll>& a, vector<ll>& b, vector<vector<int> >& route, vector<vector<int> >& scc) {
	int sz = scc.size();
	vector<ll> p(sz), q(sz);

	vector<vector<int> > dag(sz, vector<int>({}));
	vector<int> group(n);
	for (int i = 0; i < sz; i++) {
		for (int x : scc[i]) {
			group[x] = i;
			p[i] += a[x];	q[i] += b[x];
		}
	}
	a = p;	b = q;

	for (int i = 0; i < n; i++) {
		for (int x : route[i]) {
			int a = group[i];	int b = group[x];
			if (a != b) {
				dag[a].push_back(b);
			}
		}
	}
	for (vector<int>& v : dag) {
		sort(all(v));	v.erase(unique(all(v)), v.end());
	}

	return dag;
}


vector<vector<int> > get_rev_graph(int n, vector<vector<int> >& route) {
	vector<vector<int> > ret(n);
	for (int i = 0; i < n; i++) {
		for (int x : route[i]) {
			ret[x].push_back(i);
		}
	}

	return ret;
}


bool check(ll mid, int n, vector<ll>& a, vector<ll>& b, vector<vector<int> >& rdag) {
	vector<ll> dp(n);
	for (int i = 0; i < n; i++) {
		dp[i] = a[i] - b[i] * mid;
	}
	for (int i = n - 1; i >= 0; i--) {
		if (dp[i] >= 0) {
			dp[i] = 0;
			continue;
		}
		if (rdag[i].empty()) {
			return false;
		}
		for (int x : rdag[i]) {
			dp[x] += dp[i];
		}
	}
	return true;
}


int main(void){
	int n;	cin >> n;
	vector<ll> a(n), b(n);
	vector<int> c(n);
	ll sa = 0, sb = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];	sa += a[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> b[i];	sb += b[i];
	}
	for (int i = 0; i < n; i++) {
		cin >> c[i];	c[i]--;
	}

	vector<vector<int> > route(n, vector<int>({}));
	scc_graph g(n);
	for (int i = 0; i < n; i++) {
		route[c[i]].push_back(i);
		g.add_edge(c[i], i);
	}
	vector<vector<int> > scc = g.scc();
	vector<vector<int> > dag = convert_SCC_to_DAG(n, a, b, route, scc);
	n = scc.size();
	vector<vector<int> > rdag = get_rev_graph(n, dag);

	ll ok = 0;
	ll ng = sa / sb + 1;
	while (ng - ok > 1) {
		ll mid = (ok + ng) >> 1ll;
		if (check(mid, n, a, b, rdag)) {
			ok = mid;
		}
		else {
			ng = mid;
		}
	}
	cout << ok << endl;

	return 0;
}