def matpow(A, B, w, MOD):
    l = len(A)
    while w:
        if w & 1:
            C = [0] * l
            for i in range(l):
                for j in range(l):
                    C[i] += A[i][j] * B[j]
                    C[i] %= MOD
            B = C
        C = [[0] * l for _ in range(l)]
        for i in range(l):
            for j in range(l):
                for k in range(l):
                    C[i][j] += A[i][k] * A[k][j]
                    C[i][j] %= MOD
        A = C
        w >>= 1
    return B

MOD1 = 10 ** 9 + 7
MOD2 = 101010101010101010101

n = int(input())
A = [[100, 1], [0, 1]]
B = [0, 1]
ans1 = matpow(A, B, n, MOD1)[0]
ans2 = matpow(A, B, n, MOD2)[0]
print(ans1, ans2)