#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    auto t = lcm(a + b, c + d);
    int32_t t1 = 0, t2 = 0, ts = 0;
    for (auto i = 0; i < t; ++i) {
        if (t1 < a && t2 < c)
            ++ts;
        t1 = (t1 + 1) % (a + b);
        t2 = (t2 + 1) % (c + d);
    }
    int32_t ans = (e / t) * ts;
    for (auto i = 0; i < e % t; ++i) {
        if (t1 < a && t2 < c)
            ++ans;
        t1 = (t1 + 1) % (a + b);
        t2 = (t2 + 1) % (c + d);
    }
    cout << ans << endl;
    return 0;
}