def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)
def lcm(a, b):
    return a // gcd(a, b) * b

ans = 0
A, B, C, D, E = map(int, input().split())
T1 = A + B
T2 = C + D
T = lcm(A + B, C + D)
ans1 = 0
for i in range(T):
    if i % T1 < A and i % T2 < C:
        ans1 += 1
ans = ans1 * (E // T)
E %= T
for i in range(E):
    if i % T1 < A and i % T2 < C:
        ans += 1
print(ans)