/**
 * author:  orzvanh14 (  )
 * created: 19.06.2026 19:15:02
**/
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define nn "\n"

const int mod = 1e9 + 7;
const int N = 1e5 + 5;
int D[N];

void solve(){
    int n;
    cin >> n;

    if (n == 1) {
        cout << 0 << nn;
        return;
    }
    if (n == 2) {
        cout << 1 << nn;
        return;
    }

    D[1] = 0;
    D[2] = 1;
    for(int i = 3; i <= n; i++){
        // Công thức: D[n] = (n - 1) * (D[n-1] + D[n-2]) % mod
        D[i] = (i - 1) * (D[i - 1] + D[i - 2]) % mod;
    }

    cout << D[n] << nn;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
    return (0 ^ 0);
}