#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

int main() {
    int n;
    cin >> n;
    LL mod = 1000000000 + 7;

    vector<LL> a(n + 1);
    a[0] = 1;
    a[1] = 1;
    a[2] = 2;
    a[3] = 6;
    a[4] = 28;
    a[5] = 150;
    for (int i = 6; i <= n; i++) {
        a[i] = (i % mod * (a[i - 2] / (i - 2) + a[i - 1]) % mod) % mod;
    }

    cout << a[n] % mod << endl;

    return 0;
}