You are given an integer N. Find the number of strings of length N that satisfy the following conditions, modulo 10^9+7:

* The string does not contain characters other than `A`, `C`, `G` and `T`.
* The string does not contain `AGC` as a substring.
* The condition above cannot be violated by swapping two adjacent characters once.

Constraints

* 3 \leq N \leq 100

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of strings of length N that satisfy the following conditions, modulo 10^9+7.

Examples

Input

3


Output

61


Input

4


Output

230


Input

100


Output

388130742

public class Main {
  private static void solve() {
    int n = ni();
    int mod = 1000000000 + 7;

    long[][][][] dp = new long[n + 1][5][5][5];
    dp[0][0][0][0] = 1;
    for (int i = 0; i < n; i++) {
      for (int s = 0; s <= 4; s++) {
        for (int t = 0; t <= 4; t++) {
          for (int u = 0; u <= 4; u++) {
            for (int k = 1; k <= 4; k++) {
              if (check(s, t, u, k)) {
                dp[i + 1][t][u][k] += dp[i][s][t][u];
                dp[i + 1][t][u][k] %= mod;
              }
            }
          }
        }
      }
    }

    long ret = 0;
    for (int s = 0; s <= 4; s++) {
      for (int t = 0; t <= 4; t++) {
        for (int u = 0; u <= 4; u++) {
          ret += dp[n][s][t][u];
          ret %= mod;
        }
      }
    }
    System.out.println(ret);
  }

  private static boolean check(int s, int t, int u, int k) {
    if (t == 1 && u == 2 && k == 3 || t == 1 && u == 3 && k == 2 || t == 2 && u == 1 && k == 3) {
      return false;
    }

    if (s == 1 && t == 2 && k == 3 || s == 1 && u == 2 && k == 3) {
      return false;
    }
    return true;
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
