#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    ll f = lcm(a+b, c+d);
    vector<ll> x(f, 0);
    rep(i, 0, f) {
        ll ta = i % (a+b);
        ll tc = i % (c+d);
        if(ta < a && tc < c) x[i] = 1;
    }
    ll ans = 0;
    rep(i, 0, f) {
        ll u = e / f + (i < e % f);
        ans += u * x[i];
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}