#include #define rep(i, n) for (int i = 0; i < (n); ++i) using namespace std; using ll = long long; using P = pair; int main() { int n = 4; vector

ps(n); rep(i, n) cin >> ps[i].second; rep(i, n) cin >> ps[i].first; sort(ps.begin(), ps.end()); ll T; cin >> T; ll ans = 0; for (auto [t, num] : ps) { ll x = min(T/t, num); ans += x; T -= x*t; } cout << ans << '\n'; return 0; }