#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long int;
using pii = pair<int, int>;

bool comp(pii a, pii b) {
  if (a.second != b.second)
    return a.second < b.second;
  else
    return a.first > b.first;
}

int main() {
  vector<int> a(4);
  rep(i, 4) cin >> a[i];
  vector<int> p(4);
  rep(i, 4) cin >> p[i];
  vector<pii> s(4);
  rep(i, 4) s[i] = {a[i], p[i]};
  sort(s.begin(), s.end(), comp);
  ll t;
  cin >> t;
  ll sum = 0;
  rep(i, 4) {
    ll calc = min(t / s[i].second, (ll)s[i].first);
    t -= calc * s[i].second;
    sum += calc;
  }
  cout << sum << endl;
  return 0;
}