#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

ll mod = 1e9 + 7;
ll a[100010];
ll n,g_sum,k_sum = 1; 

int main()
{
	cin >> n;
	a[1] = 1;
	for (int i = 2; i < n + 1; i++) {
		if (i % 2 == 0) {
			a[i] = i * k_sum %mod;
			g_sum += a[i];
			g_sum %= mod;
		}
		else {
			a[i] = i * g_sum %mod;
			k_sum += a[i];
			k_sum %= mod;
		}
	}
	cout << a[n] << endl;
	return 0;
}