#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }

int main() {
  int a, b, c, d, e;
  cin >> a >> b >> c >> d >> e;
  int l = lcm(a + b, c + d);
  vector<int> s(l + 1);
  rep(i, l) {
    bool ok1 = (i % (a + b)) < a;
    bool ok2 = (i % (c + d)) < c;
    if (ok1 && ok2) s[i + 1] = s[i] + 1;
    else s[i + 1] = s[i];
  }
  int ans = e / l * s[l];
  ans += s[e % l];
  cout << ans << endl;
  return 0;
}