#include <bits/stdc++.h>
using namespace std;

using vec = vector<int64_t>;
using mat = vector<vec>;

mat mul_mod(mat &a, mat &b, int64_t mod)
{
	mat c(a.size(), vec(b[0].size(), 0));
	for (int i = 0; i < a.size(); i++)
	{
		for (int j = 0; j < b[0].size(); j++)
		{
			for (int k = 0; k < a[0].size(); k++)
			{
				(c[i][j] += a[i][k] * b[k][j]) %= mod;
			}
		}
	}
	return c;
}

mat pow_mod(mat &a, int64_t n, int64_t mod)
{
	mat r(a.size(), vec(a.size(), 0));
	for (int i = 0; i < a.size(); i++)
	{
		r[i][i] = 1;
	}
	for (; n; n >>= 1)
	{
		if (n & 1)
		{
			r = mul_mod(r, a, mod);
		}
		a = mul_mod(a, a, mod);
	}
	return r;
}

int main()
{
	int64_t n, mod = 1000000007;
	cin >> n;
	mat m(2, vec(2, 0));
	m[0][0] = m[0][1] = m[1][0] = 1;
	m = pow_mod(m, n - 1, mod);
	mat a(2, vec(1, 0));
	a[0][0] = 1;
	int64_t x = mul_mod(m, a, mod)[0][0];
	m[0][0] = m[0][1] = m[1][0] = 1;
	m[1][1] = 0;
	m = pow_mod(m, n, mod);
	cout << (x * mul_mod(m, a, mod)[0][0] % mod) << endl;
	return 0;
}