#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

const ll mod = 1e9 + 7;

int main() {
	ll n;
	cin >> n;
	if (n >= mod){
		cout << 0 << endl;
		return 0;
	}
	ll ans;
	int p = 100000000;
	ll a[] = {1, 927880474,933245637,668123525,429277690,733333339,724464507,957939114,203191898,586445753,698611116};
	int x = n/p, y = n % p; 
	ans = a[x];

	FOR(i,1,y){
		ans = (ans * (x*p + i)) % mod;
	}
	cout << ans << endl;
    return 0;
}