#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int a, b, c, d, e;
    cin >> a >> b >> c >> d >> e;
    int k = (a+b)*(c+d);
    int ans = 0;
    for (int i = 0; i < k; ++i) {
        int x = e/k+(i < e%k);
        if(i%(a+b) < a && i%(c+d) < c) ans += x;
    }
    cout << ans << "\n";
    return 0;
}