#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
ll A[1010100][4];
ll mo=1000000007;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	A[0][0]=1;
	A[1][1]=1;
	A[2][2]=1;
	for(i=3;i<=N;i++) {
		(A[i][1]+=A[i-1][0]+A[i-1][2]+A[i-1][3])%=mo;
		(A[i][2]+=A[i-2][0]+A[i-2][1]+A[i-2][3])%=mo;
		(A[i][3]+=A[i-3][0]+A[i-3][1]+A[i-3][2])%=mo;
		
	}
	cout<<(A[N][1]+A[N][2]+A[N][3])%mo<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}