import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum MO = 10L^^9 + 7;
enum V = 3^^3;

long[][] mul(long[][] a, long[][] b) {
  auto ret = new long[][](V, V);
  foreach (u; 0 .. V) foreach (w; 0 .. V) foreach (v; 0 .. V) {
    (ret[u][v] += a[u][w] * b[w][v]) %= MO;
  }
  return ret;
}

void main() {
  /*
    0: ok
    1: empty
    2: horizontal half
  */
  int encode(int b0, int b1, int b2) {
    return b0 * 3^^0 + b1 * 3^^1 + b2 * 3^^2;
  }
  auto A = new long[][](V, V);
  foreach (u; 0 .. V) {
    const a0 = (u / 3^^0) % 3;
    const a1 = (u / 3^^1) % 3;
    const a2 = (u / 3^^2) % 3;
    if (a0 != 2 && a1 != 2) {
      switch (a2) {
        case 0: {
          ++A[u][encode(0, 0, 1)];
          ++A[u][encode(0, 0, 2)];
        } break;
        case 1: {
          ++A[u][encode(0, 0, 2)];
        } break;
        case 2: {
          ++A[u][encode(0, 0, 0)];
        } break;
        default: assert(false);
      }
    }
    if (a1 != 2 && a2 != 2) {
      switch (a0) {
        case 0: {
          ++A[u][encode(1, 0, 0)];
          ++A[u][encode(2, 0, 0)];
        } break;
        case 1: {
          ++A[u][encode(2, 0, 0)];
        } break;
        case 2: {
          ++A[u][encode(0, 0, 0)];
        } break;
        default: assert(false);
      }
    }
    /*
      0: horizontal
      1: empty
    */
    foreach (c0; 0 .. 2) foreach (c1; 0 .. 2) foreach (c2; 0 .. 2) {
      if (c0 && c1) continue;
      if (c1 && c2) continue;
      if (a0 != 0 && c0) continue;
      if (a1 != 0 && c1) continue;
      if (a2 != 0 && c2) continue;
      const b0 = c0 ? 1 : (a0 == 2) ? 0 : 2;
      const b1 = c1 ? 1 : (a1 == 2) ? 0 : 2;
      const b2 = c2 ? 1 : (a2 == 2) ? 0 : 2;
      ++A[u][encode(b0, b1, b2)];
    }
  }
  
  try {
    for (; ; ) {
      const N = readLong();
      auto a = A;
      auto b = new long[][](V, V);
      foreach (u; 0 .. V) {
        b[u][u] = 1;
      }
      for (long n = N; n; n >>= 1) {
        if (n & 1) {
          b = mul(b, a);
        }
        a = mul(a, a);
      }
      long ans;
      foreach (u; 0 .. V) {
        const a0 = (u / 3^^0) % 3;
        const a1 = (u / 3^^1) % 3;
        const a2 = (u / 3^^2) % 3;
        if (a0 != 2 && a1 != 2 && a2 != 2) {
          (ans += b[0][u]) %= MO;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}