N = int(input()) mod = 1000000007 def fib(n): if n <= 1: return n result = [1, 0, 0, 1] matrix = [1, 1, 1, 0] while n > 0: if n % 2: result = mul(matrix, result) matrix = mul(matrix, matrix) n //= 2 return result[2] % mod def mul(a, b): return [a[0]*b[0]% mod + a[1]*b[2]% mod, a[0]*b[1]% mod + a[1]*b[3]% mod, a[2]*b[0]% mod + a[3]*b[2]% mod, a[2]*b[1]% mod + a[3]*b[3]% mod] print(fib(N)*fib(N+1)%mod)