def gcd(a,b):
    if b == 0:
        return a
    else:
        return gcd(b,a%b)

def lcm(a, b):
    return a * b // gcd (a, b)

A,B,C,D,E = map(int,input().split())
n = lcm(A+B,C+D)
end = min(n,E)
robot = [False]*end
flag1 = flag2 = False
cnt1 = B
cnt2 = D
for i in range(end):
    if flag1:
        if cnt1%A == 0:
            flag1 = False
            cnt1 -= A
    else:
        if cnt1%B == 0:
            flag1 = True
            cnt1 -= B
    if flag2:
        if cnt2%C == 0:
            flag2 = False
            cnt2 -= C
    else:
        if cnt2%D == 0:
            flag2 = True
            cnt2 -= D
    if flag1 and flag2:
        robot[i] = True
    cnt1 += 1
    cnt2 += 1

ans = robot.count(True)
if n < E:
    ans *= E//n
    remain = E%n
    ans += robot[:remain].count(True)

print(ans)