#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll idx[100005];
ll a[100005];
ll b[100005];
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
ll n;
cin >> n;
for(ll i = 1; i <= n; i++) cin >> idx[i];
for(ll i = 1; i <= n; i++) cin >> a[i];
for(ll i = 1; i <= n; i++) cin >> b[i];
ll l = 0, r = 1e9 + 1;
while(l != r - 1){
ll mid = (l + r) / 2;
ll lo = 0, hi = 1e9;
bool ok = true;
for(ll i = 1; i <= n; i++){
if(a[i] == b[i]){
if(a[i] * mid > idx[i]) ok = false;
}
else if(a[i] < b[i]){
if(a[i] * mid > idx[i]) ok = false;
if(b[i] * mid <= idx[i]) continue;
ll need = mid - (idx[i] - a[i]*mid) / (b[i] - a[i]);
lo = max(lo, need);
}
else{
if(b[i] * mid > idx[i]) ok = false;
if(a[i] * mid <= idx[i]) continue;
ll limit = (idx[i] - b[i]*mid) / (a[i] - b[i]);
hi = min(hi, limit);
}
}
if(ok && lo <= hi) l = mid;
else r = mid;
}
cout << l;
}
