#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };


ll fib[101010];
ll sum[101010];


struct Fibonacci {
	ll mod = 1e9 + 7;
	vector<vector<ll>> matpow(vector<vector<ll>>a,vector<vector<ll>>b){
		vector<vector<ll>>ret(a.size(), vector<ll>(b[0].size(),0));
		rep(i, 0, a.size()) {
			rep(j, 0, b[0].size()) {
				rep(k, 0, b.size()) {
					ret[i][j] += a[i][k] * b[k][j];
					ret[i][j] %= mod;
				}
			}
		}
		return ret;
	}


	map<ll, vector<vector<ll>>>memo;
	set<int>used;
	vector<vector<ll>> pow(ll n) {
		if (n == 1) {
			vector<vector<ll>> ret = { {1,1},{1,0} };
			return ret;
		}
		else if (used.count(n) != 0) {
			return memo[n];
		}
		else if (n % 2 == 0) {
			used.insert(n);
			return memo[n] = matpow(pow(n/2),pow(n/2));
		}
		else {
			used.insert(n);
			return memo[n] = matpow(pow(1),pow(n-1));
		}
	}

	ll query(ll n) {
		if (n == 0)return 0;
		else if (n == 1) return 1;
		vector<vector<ll>>ans = pow(n);
		return ans[1][0];
	}
};


int main() {
	ll n;
	cin >> n;
	Fibonacci f;
	
	ll fn = f.query(n);
	ll fn1 = f.query(n + 1);
	cout << (fn*fn1) % MOD << endl;

	return 0;
}