#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
ll A[100100], acc[100100];
ll MOD = 1e9 + 7;

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;

    A[1] = 1ll;
    A[2] = 2ll;
    acc[1] = 1ll;
    acc[2] = 2ll;
    
    for(int i=3;i<=N;++i){
        A[i] = acc[i-1] * i % MOD;
        acc[i] = (acc[i-2] + A[i]) % MOD;
    }

    std::cout << A[N] << std::endl;
}