#include <atcoder/all>
using namespace atcoder;
using mint = modint;

#include <bits/stdc++.h>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define repeq(i,a,b) for(ll i=a;i<=b;i++)
#define repreq(i,a,b) for(ll i=a;i>=b;i--)
#define endl '\n'
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define sortr(v) sort(v,greater<>())
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define tget(a,b) get<b>(a)
#define FI first
#define SE second
#define ALL(v) (v).begin(),(v).end()
#define INFLL 3000000000000000000LL
#define INF 1000000010
#define PI acos(-1.0L)

using namespace std;

typedef long long ll;
typedef pair<ll,ll> Pll;
typedef vector<int> Vi;
typedef vector<ll> Vl;
typedef vector<Vl> VVl;
typedef vector<VVl> VVVl;
typedef vector<mint> Vm;
typedef vector<Vm> VVm;
typedef vector<string> Vs;
typedef vector<double> Vd;
typedef vector<char> Vc;
typedef vector<bool> Vb;
typedef vector<Pll> VPll;
typedef priority_queue<ll> PQl;
typedef priority_queue<ll,vector<ll>,greater<ll>> PQlr;

/* print */
template <typename T>
ostream& operator<<(ostream& os,const vector<T> &V){
int N=V.size();if(N==0){os<<'.'<<endl;return os;}
rep(i,0,N-1){os<<V[i]<<' ';}os<<V[N-1]<<endl;return os;}
template <typename T>
ostream& operator<<(ostream& os,const vector<vector<T>> &V){
int N=V.size();rep(i,0,N)os<<V[i];return os;}
template <typename T,typename S>
ostream& operator<<(ostream&os,pair<T,S>const&P){os<<P.FI<<' '<<P.SE;return os;}
ostream& operator<<(ostream&os,mint const&M){os<<M.val();return os;}

/* useful */
template<typename T>void Vin(vector<T> &v){int n=v.size();rep(i,0,n)cin>>v[i];}
template<typename T>int SMALLER(vector<T> &a,T x){
return lower_bound(a.begin(),a.end(),x)-a.begin();}
template<typename T>int orSMALLER(vector<T> &a,T x){
return upper_bound(a.begin(),a.end(),x)-a.begin();}
template<typename T>int BIGGER(vector<T>&a,T x){return a.size()-orSMALLER(a,x);}
template<typename T>int orBIGGER(vector<T>&a,T x){return a.size()-SMALLER(a,x);}
template<typename T>int COUNT(vector<T> &a,T x){
return upper_bound(ALL(a),x)-lower_bound(ALL(a),x);}
template<typename T>bool chmax(T &a,T b) {if(a<b){a=b;return 1;}return 0;}
template<typename T>bool chmin(T &a,T b) {if(a>b){a=b;return 1;}return 0;}
template<typename T>void press(T &v){v.erase(unique(ALL(v)),v.end());}
template<typename T>vector<int> zip(vector<T> b){pair<T,int> p[b.size()+10];
int a=b.size();vector<int> l(a);for(int i=0;i<a;i++) p[i]=mp(b[i],i);
sort(p,p+a);int w=0;for(int i=0;i<a;i++){if(i&&p[i].first!=p[i-1].first)w++;
l[p[i].second]=w;}return l;}
template<typename T>vector<T> vis(vector<T> &v){
vector<T> S(v.size()+1);rep(i,1,S.size())S[i]+=v[i-1]+S[i-1];return S;}

ll dem(ll a,ll b){return((a+b-1)/(b));}
ll dtoll(double d,int g){return round(d*pow(10,g));}

const int MOD = 1000000007;
//const int MOD = 998244353;
const double EPS = 1e-10;

void init(){mint::set_mod(MOD);
cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(12);}

/********************************** START **********************************/

vector<long long> uku = {
1,682498929,491101308,76479948,723816384,67347853,27368307,625544428,
199888908,888050723,927880474,281863274,661224977,623534362,970055531,261384175,
195888993,66404266,547665832,109838563,933245637,724691727,368925948,268838846,
136026497,112390913,135498044,217544623,419363534,500780548,668123525,128487469,
30977140,522049725,309058615,386027524,189239124,148528617,940567523,917084264,
429277690,996164327,358655417,568392357,780072518,462639908,275105629,909210595,
99199382,703397904,733333339,97830135,608823837,256141983,141827977,696628828,
637939935,811575797,848924691,131772368,724464507,272814771,326159309,456152084,
903466878,92255682,769795511,373745190,606241871,825871994,957939114,435887178,
852304035,663307737,375297772,217598709,624148346,671734977,624500515,748510389,
203191898,423951674,629786193,672850561,814362881,823845496,116667533,256473217,
627655552,245795606,586445753,172114298,193781724,778983779,83868974,315103615,
965785236,492741665,377329025,847549272,698611116
}; // MOD = 1000000007

long long big_stpow(long long n){
  if(n >= MOD) return 0;
  int am = n%10000000;
  int ka = n/10000000*10000000;
  mint ret = uku[n/10000000];
  repeq(i,ka+1,ka+am) ret *= i;
  return ret.val();
}

vector<long long> uku_make(long long mod) { // MODが異なる場合はまずこれでukuを生成
  mint now = 1;
  vector<long long> uki;
  rep(i,1,mod) {
    if((i-1)%10000000==0) uki.pb(now.val());
    now *= i;
  }
  cout << '{';
  long long m = uki.size();
  rep(i,0,m) {
    if(i%8==0) cout << endl;
    if(i!=m-1) cout << uki[i] <<',';
    else cout << uki[i] <<'}'<<endl;
  }
  return uki;
}

void sol() {
  //uku_make(MOD);
  ll n;cin >> n;
  cout << big_stpow(n) << endl;
}

int main() {
  init();
  int q = 1;
  //cin >> q;
  while(q--) sol();
  return 0;
}