#include <iostream> #define MOD 1000000007 #define ll long long using namespace std; void multiply(ll F[2][2], ll M[2][2]); void power(ll F[2][2], ll n); ll fibo(ll n) { ll F[2][2] = { { 1, 1 }, { 1, 0 } }; if (n == 0) return 1; power(F, n - 1); return F[0][0] % MOD; } void power(ll F[2][2], ll n) { if (n == 1 || n == 0) return; ll M[2][2] = { { 1, 1 }, { 1, 0 } }; power(F, n / 2); multiply(F, F); if (n % 2 != 0) multiply(F, M); } void multiply(ll F[2][2], ll M[2][2]) { ll x = ((F[0][0] % MOD * M[0][0] % MOD) % MOD + (F[0][1] % MOD * M[1][0] % MOD) % MOD) % MOD; ll y = ((F[0][0] % MOD * M[0][1] % MOD) % MOD + (F[0][1] % MOD * M[1][1] % MOD) % MOD) % MOD; ll z = ((F[1][0] % MOD * M[0][0] % MOD) % MOD + (F[1][1] % MOD * M[1][0] % MOD) % MOD) % MOD; ll w = ((F[1][0] % MOD * M[0][1] % MOD) % MOD + (F[1][1] % MOD * M[1][1] % MOD) % MOD) % MOD; F[0][0] = x; F[0][1] = y; F[1][0] = z; F[1][1] = w; } int main() { ll n; cin >> n; cout << fibo(n + 1) % MOD; return 0; }