#include <bits/stdc++.h>

#define all(v) (v).begin(), (v).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (ll)(m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (ll)(m); --i)

using namespace std;

using ld = long double;
using ll = long long int;
using pl = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vpl = vector<pl>;

template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> T chmax(T &a, const T &b) { return a = max(a, b); }
template <class T> T chmin(T &a, const T &b) { return a = min(a, b); }

const ll INF = 100000000000000000;
const ll MAX = 500005;
const ll MOD = 1000000007;
// const ll MOD = 998244353;

int main(void) {

  ll a, b, c, d, x;
  cin >> a >> b >> c >> d >> x;

  ll e = a + b, f = c + d;
  ll roop_cost = lcm(e, f);

  vl imos(roop_cost + 1, 0);

  for (int i = 0; i < roop_cost; i += a + b) {
    ++imos[i];
    --imos[i + a];
  }

  for (int i = 0; i < roop_cost; i += c + d) {
    ++imos[i];
    --imos[i + c];
  }

  rep(i, roop_cost) imos[i + 1] += imos[i];

  vl imos_sum(imos.size() + 1, 0);
  rep(i, imos.size()) imos_sum[i + 1] += imos_sum[i] + (imos[i] == 2);

  ll ans = ((x / roop_cost) * imos_sum.back()) + imos_sum[x % roop_cost];
  cout << ans << endl;

  return (0);
}