#include <bits/stdc++.h>
using namespace std;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> B(N);
  for (int i = 0; i < N; i++){
    cin >> B[i];
  }
  vector<int> C(N);
  for (int i = 0; i < N; i++){
    cin >> C[i];
    C[i]--;
  }
  long long SA = 0, SB = 0;
  for (int i = 0; i < N; i++){
    SA += A[i];
    SB += B[i];
  }
  long long tv = 0, fv = SA / SB + 1;
  while (fv - tv > 1){
    long long mid = (tv + fv) / 2;
    vector<long long> B2(N);
    for (int i = 0; i < N; i++){
      B2[i] = B[i] * mid;
    }
    vector<long long> A2(N);
    for (int i = 0; i < N; i++){
      A2[i] = A[i];
    }
    vector<int> in(N, 0);
    for (int i = 0; i < N; i++){
      in[C[i]]++;
    }
    queue<int> Q;
    for (int i = 0; i < N; i++){
      if (in[i] == 0){
        Q.push(i);
      }
    }
    bool ok = true;
    while (!Q.empty()){
      int v = Q.front();
      Q.pop();
      if (A2[v] < B2[v]){
        A2[C[v]] -= B2[v] - A2[v];
      }
      in[C[v]]--;
      if (in[C[v]] == 0){
        Q.push(C[v]);
      }
    }
    if (ok){
      for (int i = 0; i < N; i++){
        if (in[i] == 1){
          vector<int> idx = {i};
          while (true){
            int v = idx.back();
            in[v] = 0;
            if (in[C[v]] == 0){
              break;
            }
            v = C[v];
            idx.push_back(v);
          }
          long long R = 0;
          for (int j : idx){
            R += A2[j] - B2[j];
          }
          if (R < 0){
            ok = false;
          }
        }
      }
    }
    if (ok){
      tv = mid;
    } else {
      fv = mid;
    }
  }
  cout << tv << endl;
}