import java.io.*; import java.util.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); long n = sc.nextLong(); long[][][] matrix = new long[60][6][6]; long tmp = pow(6, MOD - 2); matrix[0] = new long[][]{{tmp, tmp, tmp, tmp, tmp, tmp}, {1, 0, 0, 0, 0, 0}, {0, 1, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0}, {0, 0, 0, 1, 0, 0}, {0, 0, 0, 0, 1, 0}}; for (int i = 1; i < 60; i++) { for (int a = 0; a < 6; a++) { for (int b = 0; b < 6; b++) { for (int c = 0; c < 6; c++) { matrix[i][a][c] += matrix[i - 1][a][b] * matrix[i - 1][b][c]; matrix[i][a][c] %= MOD; } } } } long[] ans = new long[]{1, 0, 0, 0, 0, 0}; for (int i = 59; i >= 0; i--) { if (n < (1L << i)) { continue; } n -= (1L << i); long[] nexts = new long[6]; for (int a = 0; a < 6; a++) { for (int b = 0; b < 6; b++) { nexts[a] += matrix[i][a][b] * ans[b] % MOD; nexts[a] %= MOD; } } ans = nexts; } System.out.println(ans[0]); } static long pow(long x, int p) { if (p == 0) { return 1; } else if (p % 2 == 0) { return pow(x * x % MOD, p / 2); } else { return pow(x, p - 1) * x % MOD; } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }