# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
typedef pair<LL, LL> pii;
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)

LL n;
const LL mod = 1e9 + 7;

int a[101010] = {
    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
};

int main(){
    INIT;
    cin >> n;
    if(n >= 1e9 + 7){
        cout << 0 << endl;
    }
    LL m = n / 10000000;
    LL ans = a[m];
    for(LL i = m * 10000000 + 1;i <= n;i++){
        ans *= i;
        ans %= mod;
    }
    cout << ans << endl;
}