import java.io.*;
import java.util.*;


class Main {
    static final long MOD=1000000007;
    static long[][]matMul(long[][]a,long[][]b){
        int n=a.length;
        int m=b.length;
        int l=b[0].length;
        long[][]ret=new long[n][l];
        for(int i=0;i<n;++i)
            for(int j=0;j<m;++j)
                for(int k=0;k<l;++k)
                    ret[i][k]=(ret[i][k]+a[i][j]*b[j][k])%MOD;
        return ret;
    }
    static long[][] powerMat(long[][]x, long exponent) {
        int n=x.length;
	long[][] prod = new long[n][n];
        for(int i=0;i<n;++i)prod[i][i]=1;
	for (int i = 63; i >= 0; --i) {
	    prod = matMul(prod,prod);
	    if ((exponent & 1L << i) != 0) {
		prod =matMul(prod,x);
	    }
	}
	return prod;
    }
    public static void main(String[] args) {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        long n=sc.nextLong();
        long[][]trans=new long[27][27];
        int valid=0x60b;
        for(int i=0;i<27;++i){
            int[]a=new int[3];
            a[0]=i%3;
            a[1]=i/3%3;
            a[2]=i/9;
            for(int j=0;j<8;++j){
                boolean ok=true;
                for(int k=0;k<3;++k){
                    if((j&1<<k)!=0)
                        ok&=a[k]>=1;
                    else
                        ok&=a[k]<=1;
                }
                if(!ok)continue;
                int pb=j;
                for(int k=0;k<3;++k)
                    if(a[k]==0){
                        if((pb&(1<<k))!=0)throw new Error();
                        pb|=1<<k;
                    }
                if((pb&3)==0||(pb&6)==0)continue;
                int cb=j;
                int nxt=0;
                int[]pw={1,3,9};
                for(int k=0;k<3;++k)
                    if((cb&1<<k)==0){
                        if(a[k]>=2)throw new Error();
                        nxt+=(a[k]+1)*pw[k];
                    }
                trans[i][nxt]+=1;
                if((j&3)==0){
                    int pn=(j&1<<2)==0?(a[2]+1)*9:0;
                    trans[i][pn]+=1;
                }
                if((j&6)==0){
                    int pn=(j&1<<0)==0?(a[0]+1)*1:0;
                    trans[i][pn]+=1;
                }
            }
        }
        long[][]pw=powerMat(trans,n);
        long ans=0;
        for(int i=0;i<27;++i)
            if((valid&1<<i)!=0)
                ans=(ans+pw[0][i])%MOD;
        out.println(ans);
        out.close();
    }
    // http://codeforces.com/blog/entry/7018
    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;
    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine(){
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}