#include <iostream>
#include <vector>

using namespace std;

typedef long long int ll;

int main() {
    int n;
	cin >> n;
	
	
    vector<ll> req(n);
    vector<ll> stock(n);
    vector<ll> cost(n);
    ll budget;

    for (int i = 0; i < n; i++) {
        cin >> req[i];
    }

    for (int i = 0; i < n; i++) {
        cin >> stock[i];
    }

    for (int i = 0; i < n; i++) {
        cin >> cost[i];
    }

    // Total budget
    cin >> budget;

	ll low = 0;
	ll high = 1e8;
	ll answer = 0;

    // Binary search to find maximum possible items 'i'
    while (low < high) {
    	ll mid = (low + high) / 2;
        ll sum = 0;

        for (int j = 0; j < n; j++) {
            ll req_amount = req[j] * mid;
            ll need = req_amount - stock[j];

            if (need > 0) {
                sum += need * cost[j];
            }
        }

        if (sum <= budget) {
			answer = mid;
			low = mid + 1;
        } else {
             high = mid - 1; // Budget exceeded
        }
    }

    cout << "Answer: " << answer << "\n";

    return 0;
}