#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))

#define MOD 1000000007
#define INF 1000000000
#define MAX_N 100010

ll N;
ll a[MAX_N];
ll sum[MAX_N];

int main()
{
    ZERO(a);
    ZERO(sum);
    cin >> N;
    sum[1] = 1;
    sum[0] = 0;
    a[1] = 1;
    for(int i = 2; i <= N; ++i) {
        a[i] = i * sum[i - 1];
        a[i] %= MOD;
        sum[i] = sum[i - 2] + a[i];
        sum[i] %= MOD;
        //printf("a[%d]: %lld\n", i, a[i]);
        //printf("sum[%d]: %lld\n", i, sum[i]);
    }
    printf("%lld\n", a[N]);
    return 0;
}