#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 100010

ll num[] = {1,927880474,933245637,668123525,429277690,733333339,724464507,957939114,203191898,586445753,698611116,};

int main(){
  ll n = 0;
  
  cin >> n;

  if(n >= mod){
    puts("0");
    return 0;
  }
  
  ll t = n/100000000;
  ll ans = num[t];
  for(int i=t*100000000+1;i<=n;i++){
    ans = (ans * i)%mod;
  }
  printf("%lld\n",ans);
  return 0;
}