#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <unordered_map>
#include <iterator>
#include <functional>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;

typedef vector<ll> Array;
typedef vector<Array> Matrix;

ostream& operator<<(ostream &os, const Array &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
ostream& operator<<(ostream &os, const Matrix &t) {
FOR(it,t)os<<*it<<endl;return os;
}


Matrix mul(const Matrix &a,const Matrix &b,const ll MOD){
	Matrix res(a.size(),Array(b[0].size()));	// 零元を入れる！
	REP(i,a.size()){
		REP(j,b[0].size()){
			REP(k,a[0].size()){
				res[i][j] += a[i][k]*b[k][j];
				if(res[i][j] >= MOD) res[i][j] %= MOD;
			}
		}
	}
	return res;
}
Matrix pow(const Matrix &a,ll b, const ll MOD){
	if(b==0){
		Matrix res(a.size(),Array(a.size()));
		REP(i,a.size())res[i][i]=1;	// 単位元を入れる！
		return res;
	}
	Matrix res=pow(mul(a,a,MOD),b/2,MOD);
	if(b&1)res=mul(res,a,MOD);
	return res;
}

int T, n;
ll a, b, c;

int main(int argc, char *argv[]){
	ios::sync_with_stdio(false);
	cin >> n;
	Matrix mat({
		{0, 0, 1},
		{1, 0, 0},
		{1, 1, 0}
	});
	Matrix arr({
		{0},
		{0},
		{1}
	});
	arr = mul(pow(mat, n, MOD), arr, MOD);
	cout << (arr[0][0] + arr[1][0] + arr[2][0]) % MOD << endl;
	return 0;
}