import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, 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(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;

int N;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      
      debug {
        if (N <= 10) {
          auto dp = new long[][](N + 1, N + 1);
          dp[0][0] = 1;
          foreach (a; 0 .. N + 1) foreach (b; 0 .. N + 1) {
            if (a < N) {
              dp[a + 1][b] += dp[a][b];
            }
            if (b < N && a > b) {
              dp[a][b + 1] += dp[a][b] * (a - b);
            }
          }
          writeln(N, ": ", dp[N][N]);
        }
      }
      
      long ans = 1;
      foreach (k; 0 .. N) {
        ans *= (2 * (N - k) - 1);
        ans %= MO;
      }
      foreach (k; 0 .. N) {
        ans *= (N - k);
        ans %= MO;
      }
      foreach (k; 0 .. N) {
        ans *= (N - k);
        ans %= MO;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}