import math 

#最大公約数
def lcm(x, y):
    return (x * y) // math.gcd(x, y)

A,B,C,D,E = map(int, input().split())
lc = lcm(A+B,C+D)
L = [0]*lc
for i in range(lc):
    if i%(A+B)<A and i%(C+D)<C:
        L[i]=1
c = sum(L)
print((E//lc)*c+sum(L[:E%lc]))