#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

#define MOD 1000000007

//[n*p] * [p*m] => [n*m]
template<class T>
vector< vector<T> > multmat(const vector<vector<T> > &A, const vector<vector<T>> &B, int n, int p, int m){
	vector<vector<T> > C(n, vector<T>(m,0));
	for(int i=0; i<n; i++){
		for(int k=0; k<p; k++){
			for(int j=0; j<m; j++){
				C[i][j] += A[i][k] * B[k][j];
				if(C[i][j] >= MOD) C[i][j] %= MOD;
			}
		}
	}
	return C;
}

//A[n*n]^k 
template<class T>
vector< vector<T> > mat_pow(vector<vector<T> > A, long long k){
	int n = A.size();
	vector<vector<T> > ret(n, vector<T>(n, 0) );
	for(int i=0; i<n; i++){
		ret[i][i] = 1;
	}
	while(k>0){
		if(k&1) ret = multmat(A,ret, n,n,n);
		A = multmat(A,A, n,n,n);
		k>>=1;
	}
	return ret;
}

int main(){
	long long n;
	//cin >> n;
	scanf("%lld", &n);

	vector<vector<long long>> mat = {
		{0,0,1},
		{1,0,0},
		{1,1,0}
	};
	auto mat_ = mat_pow(mat, n);

	//cerr << mat_ << endl;
	long long ans = (mat_[0][2]+mat_[1][2]+mat_[2][2])%MOD;
	//cout << (mat_[0][2]+mat_[1][2]+mat_[2][2])%MOD << endl;
	printf("%lld\n", ans);
	return 0;
}