#!/usr/bin/env ruby


require "matrix"


M = 1000000007


def mod_mul(a, b, mod=M)
  return (a * b).map{|x| x % mod}
end


def mod_pow(a, n, mod=M)
  raise "assert" unless a.square?
  b = Matrix.I(a.column_size)
  while n > 0
    if n % 2 == 1
      b = mod_mul(b, a, mod)
    end
    a = mod_mul(a, a, mod)
    n /= 2
  end
  return b
end


def solve(n, mod=M)
  a = Matrix[[1, 1], [1, 0]]
  res = mod_mul(mod_pow(a, n, mod), Vector[1, 0])
  return res[0] * res[1] % mod
end


def main()
  n = gets.to_i
  ans = solve(n)
  puts(ans)
end


main