#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MOD = 1000000007;
const ll MOD2 = 2000000016;

typedef vector<ll> vec;
typedef vector<vec> mat;

mat mul(mat& A, mat& B, ll mod) {
	mat C(A.size(), vec(B[0].size(), 0));
	for (int i = 0; i < A.size(); i++) {
		for (int k = 0; k < B.size(); k++) {
			for (int j = 0; j < B[0].size(); j++) {
				(C[i][j] += A[i][k] * B[k][j] % mod) %= mod; 
			}
		}
	}
	return C;
}

mat pow(mat A, ll n, ll mod) {
	mat B(A.size(), vec(A.size(), 0));
	for (int i = 0; i < A.size(); i++) {
		B[i][i] = 1;
	}
	while (n > 0) {
		if (n & 1) B = mul(B, A, mod);
		A = mul(A, A, mod);
		n >>= 1;
	}
	return B;
}


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n;
	cin >> n;
	mat A = {{1, 1}, {1, 0}};
	mat tmp = pow(A, n, MOD2);
	ll fn = tmp[1][0];
	tmp = pow(A, fn, MOD);
	cout << tmp[1][0] << endl;
	return 0;
}