#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define rep(i,n) for(int i=0;i<(n);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
template<class T>inline int popcount(T a) {return __builtin_popcount(a);}
template<class T>inline T emod(T a, T p) { return (a%p + p) % p;}
//-------------------
struct mint {
	ll x;
	mint(ll x=0):x(x%mod){}

	bool operator==(const mint a)const{return x==a.x;}
	bool operator!=(const mint a)const{return x!=a.x;}
	bool operator>=(const mint a){return (x >= a.x)? 1: 0;}
	bool operator<(const mint a){return !(*this>=a);}
	bool operator>(const mint a){return (x > a.x)? 1:0;}
	bool operator<=(const mint a){return !(*this>a);}
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod-a.x) >= mod) x -= mod;
			return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res+=a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res-=a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res*=a;
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res/=a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t>>1);
		a *= a;  //2 square
		if (t&1) a *= *this; 
		return a;
	}
	// for prime mod
	mint inv() const {
		return pow(mod-2);
	}
};

//here below is Matrix library.
template <class T>
using Matrix = vector< vector<T> >;

template <class T>
void init_mat(Matrix<T> &A, int h, int w){
	A.resize(h, vector<T>(w,0));
}

template <class T>
Matrix<T> dot_mat(Matrix<T> A, Matrix<T> B){
	Matrix<T> C(A.size(), vector<T>(B[0].size()));
	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] = C[i][j] + A[i][k]*B[k][j];
			}
		}
	}
	return C;
}

template <class T>
Matrix<T> pow_mat(Matrix<T> A, ll n){
	Matrix<T> B(A.size(), vector<T>(A.size()));
	for(int i=0; i<A.size(); i++) B[i][i] = 1;
	while(n){
		if(n&1) B = dot_mat(B,A);
		A = dot_mat(A,A);
		n >>= 1;
	}
	return B;
}

int main() {
    cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(15);
    ll n; cin >> n;

    Matrix<mint> A;
    init_mat(A, 2,2);
    Matrix<mint> b;
    init_mat(b, 2,1);

    b[0][0] = 1;
    b[0][1] = 0;

    A[0][0] = 1; A[0][1] = 1;
    A[1][0] = 1;
    auto B = dot_mat(pow_mat(A, n), b);
    auto C = dot_mat(A, B);
    auto ans = B[1][0] * C[1][0];
    cout << ans.x << endl;
    return 0;
}