// yukicoder: No.718 行列のできるフィボナッチ数列道場 (1)
// 2019.4.19 bal4u

#include <stdio.h>

#define MOD 1000000007

//// fibonacci数の高速計算
void multiply(int F[2][2], int M[2][2])
{
	long long f00, f01, f10, f11, x, y, z, w;
	f00 = F[0][0], f01 = F[0][1], f10 = F[1][0], f11 = F[1][1];
	x = (f00 * M[0][0] + f01 * M[1][0]) % MOD;
	y = (f00 * M[0][1] + f01 * M[1][1]) % MOD;
	z = (f10 * M[0][0] + f11 * M[1][0]) % MOD;
	w = (f10 * M[0][1] + f11 * M[1][1]) % MOD;
	F[0][0] = (int)x, F[0][1] = (int)y;
	F[1][0] = (int)z, F[1][1] = (int)w;

}

int M[2][2] = { {1,1},{1,0} };
void power(int F[2][2], long long n)
{
	if (n == 0 || n == 1) return;
	power(F, n >> 1);
	multiply(F, F);
	if (n & 1) multiply(F, M);
}

int fib(long long n)
{
	int F[2][2] = { {1,1},{1,0} };
	if (n == 0)	return 0;
	power(F, n - 1);
	return F[0][0];
}

int main()
{
	long long N;
	scanf("%lld", &N);
	printf("%d\n", (int)((long long)fib(N)*fib(N + 1) % MOD));
	return 0;
}