#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;
 
const int inf = (int)1e9; 
 
ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}


ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
} 


ll dp[100010];
 
int main(void){
	dp[1]=1;
	ll n;
	cin>>n;
	ll even = 0,odd = 0;
	even = dp[1];
	for(ll i=2;i<=n;i++){
		if(i%2==0){
			dp[i]=(i*even)%N;
			odd = (odd+dp[i])%N;
		}
		else{
			dp[i]=(i*odd)%N;
			even = (even+dp[i])%N;
		}
	}
	cout<<dp[n]%N<<endl;
	return 0;
}