import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

a,b,c,d=LI()
n=II()
g=n//8
ans=0
r=n%8
base=pow(16,g,md)
if r==0:ans=base*(b+d)*2
elif r==1:ans=base*2*b
elif r==2:ans=base*2*(b-c)
elif r==3:ans=-base*4*c
elif r==4:ans=-base*4*(a+c)
elif r==5:ans=-base*8*a
elif r==6:ans=base*8*(d-a)
elif r==7:ans=base*16*d

print(ans%md)