import numpy as np
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    md=1000000007
    n=II()
    ans1=(pow(100,n,md)-1)*pow(99,md-2,md)%md

    md=101010101010101010101
    n-=1
    ans2=np.ones(2,dtype="i8")
    base=np.array([[100,0],[1,1]],dtype="i8")
    while n:
        if n&1:ans2=np.dot(ans2,base)%md
        base=np.dot(base,base)%md
        n>>=1

    print(ans1)
    print(ans2[0])

main()