n = int(input())
assert(1 <= n <= 10**18)
if n == 1:
    print(2)
    exit()

ret = 1
if n % 2 == 1:
    ret *= 3
    n -= 1
n //= 2
if n:
    ret *= 4
    n -= 1

mod = 10**9+7
n5 = [5]
for i in range(100):
    n5.append(n5[-1]* n5[-1] % mod)
for i in range(99, -1, -1):
    if 2**i <= n:
        n -= 2**i
        ret *= n5[i]
        ret %= mod

ret *= pow(5, n, mod)

print(ret)