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

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

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


immutable MO = 10L^^12;
immutable LIM = 100;

void main() {
  auto fac = new long[LIM];
  auto over = new long[LIM];
  fac[0] = 1;
  over[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = (fac[i - 1] * i) % MO;
    over[i] = min(over[i - 1] * i, MO);
  }
  debug {
    writeln(fac[0 .. 20], " ", fac[$ - 10 .. $]);
    writeln(over[0 .. 20], " ", over[$ - 10 .. $]);
  }
  
  try {
    for (; ; ) {
      const N = readLong();
      const n = cast(int)(min(N, LIM - 1));
      writefln((over[n] >= MO) ? "%012d" : "%d", fac[n]);
    }
  } catch (EOFException e) {
  }
}