#include <iostream>
using namespace std;
const int mod = 1000000007;
int n, dp[100009];
int main() {
	cin >> n;
	dp[1] = 1;
	int s0 = 0, s1 = 1;
	for (int i = 2; i <= n; i++) {
		if (i % 2 == 0) {
			dp[i] = 1LL * i * s1 % mod;
			s0 = (s0 + dp[i]) % mod;
		}
		else {
			dp[i] = 1LL * i * s0 % mod;
			s1 = (s1 + dp[i]) % mod;
		}
	}
	cout << dp[n] << endl;
	return 0;
}