mod = 1000000007
m = mod

def mat_mul(a, b) :
    I, J, K = len(a), len(b[0]), len(b)
    c = [[0] * J for _ in range(I)]
    for i in range(I) :
        for j in range(J) :
            for k in range(K) :
                c[i][j] += a[i][k] * b[k][j]
                c[i][j] %= m
    return c


def mat_pow(x, n):
    y = [[0] * len(x) for _ in range(len(x))]

    for i in range(len(x)):
        y[i][i] = 1

    while n > 0:
        if n & 1:
            y = mat_mul(x, y)
        x = mat_mul(x, x)
        n >>= 1

    return y

N, A, B, K = map(int, input().split())
if N == 1:
	print(A)
elif N == 2:
	print(B)
else:
	l = mat_pow([[(A * A + B * B + K) * pow(A * B, mod - 2, mod) % mod, -1], [1, 0]], N - 2)
	print((l[0][0] * B + l[0][1] * A) % mod)