#include<bits/stdc++.h>
#include<iostream>
using namespace std;
using LL = long long;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
const int INF = 1 << 29;
const long long LINF = 1LL << 60;
#define all(x) (x).begin(), (x).end()
#define rep(i,n) for(int i = 0; i < (n); ++i)
template<class T>void chmin(T&a, T b){if(a > b) a = b;}
template<class T>void chmax(T&a, T b){if(a < b) a = b;}


int main(){
	long long N; cin >> N; 
	vector<vector<long long>> dp(2, vector<long long>(4, 0));
	dp[0][0] = 1;
	for(long long i = 0; i < N; ++i){
		for(int j = 0; j < 4; ++j){
			dp[(i+1)%2][j] = dp[(i%2)][(j+1)%4] + dp[(i%2)][(j+2)%4] + dp[(i%2)][(j+3)%4];
			dp[(i+1)%2][j] %= 1000000007;
			//cout << dp[(i%2)][j] << " ";
		}
		//cout << endl;
	}
	cout << dp[N%2][1] << endl;

}