N = gets.to_i
MOD = 10 ** 9 + 7

def f(n)
  return 1 if n == 1

  if n.even?
    (f(n / 2) * (100.pow(n / 2, MOD) + 1)) % MOD
  else
    (f(n - 1) * 100 + 1) % MOD
  end
end

def g(n)
  mod = 101010101010101010101
  n %= 11
  a = 1

  n.times do
    a = a * 100 + 1
  end

  a % mod
end

puts f(N)
puts g(N - 1)