def modpow(a, n, m):
    res = 1
    while n > 0:
        if (n & 1) != 0:
            res = res * a % m
        a = a * a % m
        n >>= 1
    return res

A, B, C, D = map(int, input().split())
N = int(input())

M = 10**9+7

p = (N-1) % 8
n = (N-1) // 8

F = [2 * B, 2 * (B - C), -4 * C, -4 * (A + C), -8 * A, -8 * (A - D), 16 * D, 6 * (B + D)]

V = F[p]
    
V = (V + M) % M
V = (V * modpow(16, n, M)) % M
    
print(V)