import sys, math
 
sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

a, b, c, d = na()
n = ni()

f = n // 8
e = n % 8

def colc(a, b, c, d, i):
    if i == 0:
        return b + d
    elif i == 1:
        return 2 * b
    elif i == 2:
        return 2 * (b - c)
    elif i == 3:
        return -4 * c
    elif i == 4:
        return -4 * (a + c)
    elif i == 5:
        return -8 * a
    elif i == 6:
        return -8 * (a - d)
    elif i == 7:
        return 16 * d

ans = colc(a, b, c, d, e)

ans = (ans % 1000000007 * pow(16, f, 1000000007))  % 1000000007

if ans < 0:
    ans += 1000000007

print(ans)