#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll divceil(ll A, ll B) {return (A + (B - 1)) / B;}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll A, B, C, D, E;
  cin >> A >> B >> C >> D >> E;

  vector<ll> X;
  X.push_back(0);
  for (ll t = 0; t < (A + B) * (C + D); t++)
  {
    bool r1 = (t % (A + B) < A);
    bool r2 = (t % (C + D) < C);

    if (r1 && r2)
      X.push_back(X.back() + 1);
    else
      X.push_back(X.back());
  }

  ll P = E / ((A + B) * (C + D));
  ll Q = E % ((A + B) * (C + D));
  ll ans = P * X.back() + X.at(Q);
  cout << ans << endl;
}