import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum MO = 10L^^9 + 7; long[2] mul(in long[2] a, in long[2] b) { return [(a[0] * b[0] + a[1] * b[1]) % MO, (a[0] * b[1] + a[1] * b[0] + a[1] * b[1]) % MO]; } long fib(long n) { long[2] a = [0, 1], b = [1, 0]; for (; n; n >>= 1) { if (n & 1) { b = mul(b, a); } a = mul(a, a); } return b[1]; } void main() { try { for (; ; ) { const N = readLong(); writeln((fib(N) * fib(N + 1)) % MO); } } catch (EOFException e) { } }