#include <bits/stdc++.h>
#define NIL (-1)
#define ll long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

int gcd(int a, int b) {
	if (!b) return a;
	else return gcd(b, a % b);
}

int main() {
	ll A, B, C, D, E;
	cin >> A >> B >> C >> D >> E;

	int GCD = gcd(A + B, C + D);
	int LCM = (A + B) * (C + D) / GCD;
	//cout << LCM << endl;

	ll ans = 0;
	int pt = 0;
	for (int i = 0; i < LCM; i++) {
		int a = i % (A + B);
		int b = i % (C + D);
		if ((a >= 0 && a < A) && (b >= 0 && b < C)) pt++;
	}
	ans += pt * (E / LCM);
	//cout << ans << endl;
	for (int i = 0; i < E%LCM; i++) {
		int a = i % (A + B);
		int b = i % (C + D);
		/*if (a >= 0 && a < A) cout << "a:" << i << endl;
		if (b >= 0 && b < C) cout << "b:" << i << endl;*/
		if ((a >= 0 && a < A) && (b >= 0 && b < C)) ans++;
	}
	cout << ans << endl;

	return 0;
}