#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL n;
const LL MOD = 1000000007;

LL z[] = {
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, 
};

int main() {
	cin >> n;
	
	/*
	LL x = 1;
	inc1(i, 1000000007) {
		(x *= i) %= MOD;
		if(i % 10000000 == 0) {
			cout << x << ", " << endl;
		}
	}
	*/
	
	
	LL ans;
	if(n >= MOD) {
		ans = 0;
	} else {
		ans = z[ n / 10000000 ];
		inc1(i, n % 10000000) {
			(ans *= (n / 10000000 * 10000000 + i)) %= MOD;
		}
	}
	
	cout << ans << endl;
	
	return 0;
}