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

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

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = 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) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


immutable long MO = 10^^9 + 7;

int N;

void main(string[] args) {
	try {
	for (; ; ) {
		N = readInt;
		
		auto crt = new long[][][][][][](3, 3, 2, 2, 2, 2);
		crt[0][0][0][0][0][0] = 1;
		foreach (i; 0 .. N) {
			auto nxt = new long[][][][][][](3, 3, 2, i + 3, 2, 2);
			foreach (b; 0 .. 3) foreach (c; 0 .. 3) foreach (d; 0 .. 2) {
				const a = (i + 1) - b - c - d;
				foreach (aa; 0 .. a + 1) foreach (bb; 0 .. 2) foreach (cc; 0 .. 2) {
					const tmp = crt[b][c][d][aa][bb][cc];
					if (tmp != 0) {
debug{
writeln(a," ",b," ",c," ",d,"  ",aa," ",bb," ",cc," ",0,"; ",tmp);
}
						//	small, small -> small, -1, small
						if (a - aa > 0) {
							(nxt[c + d][2][0][aa + bb][cc][0] += tmp * (a - aa)) %= MO;
						}
						if (aa > 0) {
							(nxt[c + d][2][0][(aa - 1) + bb][cc][0] += tmp * aa) %= MO;
						}
						//	-2, small -> small,* -1, small
						if (b - bb > 0) {
							(nxt[c + d][2][0][aa + bb][cc][1] += tmp * (b - bb)) %= MO;
						}
						if (bb > 0) {
							(nxt[c + d][2][0][aa + (bb - 1)][cc][1] += tmp * bb) %= MO;
						}
						//	-1, small -> -2, -1, small
						if (c - cc > 0) {
							(nxt[(c - 1) + d][1][1][aa + bb][cc][0] += tmp * (c - cc)) %= MO;
						}
						if (cc > 0) {
							(nxt[(c - 1) + d][1][1][aa + bb][cc - 1][0] += tmp * cc) %= MO;
						}
						//	-2, -1 -> small,* -1, -2
						if (d > 0) {
							(nxt[c + (d - 1)][1][1][aa + bb][cc][1] += tmp * d) %= MO;
						}
					}
				}
			}
			crt = nxt;
		}
		
		long ans;
		foreach (b; 0 .. 3) foreach (c; 0 .. 3) foreach (d; 0 .. 2) {
			(ans += crt[b][c][d][0][0][0]) %= MO;
		}
		writeln(ans);
		
	}
	} catch (EOFException) {}
}