#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;

int main(){
  ll n;
  cin >> n;
  if (n >= 10000) n = 10000;
  ll ans = 1;
  int keta = 1;
  ll truenum = 1;
  bool over = false;
  FOR(i,1,n+1){
    if(keta < 13) truenum *= i;
    else over = true;
    keta = log10(truenum) + 1;
    ans *= i;
    ans %= 1000000000000;
  }

  if(over) printf("%012lld\n", ans);
  else printf("%lld\n", ans);
  return 0;
}