#include<cstdio>

#include<cstring>

#include<cctype>

#include<algorithm>

using namespace std;

#define rep(i,s,t) for(int i=s;i<=t;i++)

#define dwn(i,s,t) for(int i=s;i>=t;i--)

#define clr(x,c) memset(x,c,sizeof(x))

#define ll long long

int read(){

	int x=0;char c=getchar();

	while(!isdigit(c)) c=getchar();

	while(isdigit(c)) x=x*10+c-'0',c=getchar();

	return x;

}

const int nmax=5;

const int mod=1e9+7;

struct node{

	ll a[nmax][nmax];

	node(){

		clr(a,0);

	}

	node operator*(const node&o)const{

	    node ans;

	    rep(i,1,4) rep(j,1,4) {

	    	rep(k,1,4) ans.a[i][j]+=a[i][k]*o.a[k][j]%mod;

	    	ans.a[i][j]%=mod;

	    }

	    return ans;

	}

};

node a,b;

int main(){

	int n=read();

	rep(i,1,4) rep(j,1,4) if(i!=j) b.a[i][j]=1;

	rep(i,1,4) a.a[i][i]=1;

	while(n){

		if(n&1) a=a*b;

		b=b*b;n>>=1;

	}

	ll ans=0;

	rep(i,1,4) rep(j,1,4) if(i!=j) rep(k,1,4) if(k!=j&&k!=i) rep(t,1,4) if(t!=i&&t!=j&&t!=k)

	  ans=(ans+a.a[1][i]*a.a[2][j]%mod*a.a[3][k]%mod*a.a[4][t]%mod)%mod;

	printf("%lld\n",ans);

	return 0;

}