def mul_mat_mod(A, B, mod):
    n = len(A)
    m = len(A[0])
    p = len(B[0])
    res = [[0 for j in range(p)] for i in range(n)]
    for i in range(n):
        for j in range(p):
            for k in range(m):
                res[i][j] = res[i][j]+A[i][k]*B[k][j]
                res[i][j] %= mod
    return res

def pow_mat_mod(A, k, mod):
    n = len(A)
    res = [[0 for j in range(n)] for i in range(n)]
    B = [[A[i][j] for j in range(n)] for i in range(n)]
    for i in range(n):
        res[i][i] = 1
    while k > 0:
        if k % 2 != 0:
            res = mul_mat_mod(res, B, mod)
        k = k//2
        B = mul_mat_mod(B, B, mod)
    return res

N = int(input())
mod_a = 1000000007
mod_b = 101010101010101010101
P = [[100,1],[0,1]]
A = pow_mat_mod(P, N-1, mod_a)
B = pow_mat_mod(P, N-1, mod_b)
x = A[0][0]*1+A[0][1]*1
y = B[0][0]*1+B[0][1]*1
x %= mod_a
y %= mod_b
print(x)
print(y)