#include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } const ll MOD = 1000000007; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v < 0) _v = (_v%MOD)+MOD; if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } ModInt operator/(ll n){ return ModInt((ModInt(n).inv()*v).v%MOD); } ModInt &operator+=(ll n){ v = (v+n)%MOD; return *this; } ModInt &operator-=(ll n){ v = (v-n+MOD)%MOD; return *this; } ModInt &operator*=(ll n){ v = (v*n+MOD)%MOD; return *this; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } ModInt operator/(ModInt n){ return ModInt((n.inv()*v).v%MOD); } ModInt &operator+=(ModInt n){ v = (v+n.v)%MOD; return *this; } ModInt &operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; return *this; } ModInt &operator*=(ModInt n){ v = (v*n.v)%MOD; return *this; } bool operator==(ModInt n){ return v == n.v; } bool operator!=(ModInt n){ return v != n.v; } ModInt &operator=(ll n){ v = n%MOD; return *this; } ModInt inv(){ if(v == 1) return ModInt(1); else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD); } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } ModInt pow(ModInt a, ll n) { assert(n >= 0); ModInt ans = 1; while (n > 0) { if (n&1) ans = ans*a; a = a*a; n >>= 1; } return ans; } using mint = ModInt; template class Matrix { public: array, N> dat; Matrix(T val) { for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ dat[i][j] = val; } } } Matrix(array, N> dat): dat(dat){ } array& operator[](int x) { return dat[x]; } }; template Matrix operator*(Matrix a, Matrix b){ Matrix c(T(0)); for(int i = 0; i < N; i++){ for(int j = 0; j < K; j++){ for(int k = 0; k < M; k++){ c.dat[i][j] += a.dat[i][k]*b.dat[k][j]; } } } return c; } template Matrix operator^(Matrix m, long long r){ Matrix ans(T(0)); for(int i = 0; i < N; i++) ans[i][i] = T(1); while (r > 0) { if (r&1) ans = (ans*m); m = (m*m); r >>= 1; } return ans; } template void print_mat(Matrix a){ for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ cout << a.dat[i][j] << ' '; } cout << endl; } } template ostream& operator<<(ostream& os, const Matrix& m){ print_mat(m); return os; } mint fib_kth(ll k){ Matrix A(mint(0)); Matrix a(mint(0)); a[0][0] = 0; a[1][0] = 1; A[0][1] = 1; A[1][0] = 1; A[1][1] = 1; auto u = (A^k)*a; return u[0][0]; } void test(int n){ mint sum = 0; for(int i = 0; i <= n; i++){ sum += fib_kth(i)*fib_kth(n-i); } cout << sum << endl; cout << (fib_kth(n+1)*n-fib_kth(n)+fib_kth(n-1)*n)/5 << endl; } mint calc(ll n){ return (fib_kth(n+1)*mint(n)-fib_kth(n)+fib_kth(n-1)*mint(n))/5; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; ll n; cin >> n; if(n%2 == 0){ cout << fib_kth(n/2+1) << endl; }else{ cout << calc(n/2+2)+calc(n/2+1) << endl; } }