#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, int(n) + 1)
#define rrep(i, n) RFOR(i, 0, n)
#define rrep1(i, n) RFOR(i, 1, int(n) + 1)
#define all(c) begin(c), end(c)
const int MOD = 1000000007;

template <typename T>
void __dump__(std::ostream &os, const T &first) {
    os << first;
}
template <typename First, typename... Rest>
void __dump__(std::ostream &os, const First &first, const Rest &... rest) {
    os << first << ", ";
    __dump__(os, rest...);
}
#define dump(...)                                         \
    do {                                                  \
        std::ostringstream os;                            \
        os << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \
        __dump__(os, __VA_ARGS__);                        \
        std::cerr << os.str() << std::endl;               \
    } while (0)

int fact(unsigned long long n) {
    unsigned long long res = 1;
    for (unsigned long long i = 1; i <= n; ++i) {
        res *= i;
        if (res >= 1e16) {
            res %= MOD;
        }
        // dump(res);
    }
    return res % MOD;
}

// n!=a p^e としたときの a mod p を求める。 O(log_p n)
int mod_fact(int n, int& e) {
    e = 0;
    if (n == 0) return 1;
    // p の倍数の部分を計算
    int res = mod_fact(n / MOD, e);
    e += n / MOD;
    // (MOD-1)! ≡ -1 なので (MOD-1)!^(n/MOD) は n/MOD の偶奇だけで計算できる
    if (n / MOD % 2 != 0) return res * (MOD - fact(n % MOD)) % MOD;
    return res * fact(n % MOD) % MOD;
}


int main() {
    ll n;
    cin >> n;
    int x;
    cout << mod_fact(n, x) << endl;
}