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 = 12;

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;
}

long[][] A;

void add(int u, int v) {
  ++A[u][v];
}
void add(int u, int[] vs) {
  foreach (v; vs) {
    add(u, v);
  }
}

void main() {
  /*
    0 1 2 3 4 5 6 7 8 9 0 1
    -       - - -   = = =  
      -     = =   - = =   =
        -   =   = = -   = =
          -   = = =   - - -
  
    0 1 2 3 4 5 6 7 8 9
        - - -       - -
        -     - -   - =
          -   -   - = =
            -   - - = -
  */
  A = new long[][](V, V);
  foreach (u; 0 .. 4) foreach (v; 0 .. 4) {
    add(u, v);
  }
  add(0, [4, 5, 6, 7]);
  add(1, [6, 7]);
  add(2, [8, 9]);
  add(3, [8, 9, 10, 11]);
  add(4, [2, 3]);
  add(5, [2, 3]);
  add(6, [3]);
  add(7, [3]);
  add(8, [0]);
  add(9, [0]);
  add(10, [0, 1]);
  add(11, [0, 1]);
  foreach (u; 4 .. 8) foreach (v; 4 .. 8) {
    if (abs(u - v) <= 1) {
      add(u, v);
    }
  }
  foreach (u; 8 .. 12) foreach (v; 8 .. 12) {
    if (abs(u - v) <= 1) {
      add(u, v);
    }
  }
  
  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 + 1; n; n >>= 1) {
        if (n & 1) {
          b = mul(b, a);
        }
        a = mul(a, a);
      }
      writeln(b[0][3]);
    }
  } catch (EOFException e) {
  }
}