import java.util.Scanner;

public class Main {
    public static long MOD = 1000000007;
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] q1 = new long[n + 1];
        long[] q2 = new long[n + 1];
        q1[1] = 1;
        q2[1] = 1;
        q1[2] = 2;
        q2[2] = 6;
        for(int i = 3;i <= n;i++) {
            q1[i] = 2 * q1[i - 1];
            q1[i] %= MOD;
            q2[i] = 2 * q1[i - 1] + 2 * q2[i - 1] + 4 * q2[i - 2];
            q2[i] %= MOD;
        }
        long sum = (4 * q2[n]) % MOD;
        for(int i = 2;i < n;i++) {
            sum = (sum + 4 * ((q1[i] * q2[n - i]) % MOD + (q1[n - i + 1] * q2[i - 1]) % MOD)) % MOD;
        }
        if(n == 1)
            sum = 2;
        System.out.println(sum);
    }
}