#include<iostream>
using namespace std;
typedef long long ll;

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

    const ll mod = 1000000007;

    if(n >= mod){
        cout << 0 << endl;
        return 0;
    }

    ll ume[11] = {1, 388742192,904824556,158036420,132400827,647619052,
                     541794170,722869575,463715736,446595916,900198419};

    ll ans = ume[n/100000000];
    for(ll i = n/100000000*100000000+1; i <= n; i++){
        ans *= i;
        ans %= mod;
    }

    cout << ans << endl;

    return 0;
}