import sys
l=int(input())
if l==2:
  print(3)
  print("INF")
  sys.exit()
print(l)
a=[[0,1],[1,1]]
def fib(n):
  ap=a
  b=[[1,0],[0,1]]
  while n>0:
    if n&1:
      c=[[0,0],[0,0]]
      for i in range(2):
        for j in range(2):
          for k in range(2):
            c[i][j]+=b[i][k]*ap[k][j]
      b=c
    c=[[0,0],[0,0]]
    for i in range(2):
      for j in range(2):
        for k in range(2):
          c[i][j]+=ap[i][k]*ap[k][j]
    ap=c
    n>>=1
  return b[0][0]+b[0][1]
if l%2==0:
  x=fib(l//2-1)
  print(fib(l-1)-x*x)
else:
  print(fib(l-1))