#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}

long long lcm(long long x, long long y) {
	return x * y / gcd(x, y);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int a, b, c, d, e; cin >> a >> b >> c >> d >> e;
	int l = lcm(a + b, c + d);
	vector<int>memo(l + 1);
	rep(i, l) {
		int x = i % (a + b);
		int y = i % (c + d);
		int num = memo[i];
		if (x < a &&y < c) num++;
		memo[i + 1] = num;
	}
	int ans = memo[l] * (e / l) + memo[e % l];
	cout << ans << endl;
	return 0;
}