#include <iostream>
#include <vector>

using namespace std;
const int mod = 1e9 + 7;

int main() {
	int n;
	cin >> n;

	vector<int> a(n + 1, 0);
	a[1] = 1;

	long long sum_odd = a[1];
	long long sum_even = 0;

	for (int i = 2; i <= n; i++) {
		if (i % 2 == 0) {
			a[i] = sum_odd * i % mod;
			sum_even = (sum_even + a[i]) % mod;
		} else {
			a[i] = sum_even * i % mod;
			sum_odd = (sum_odd + a[i]) % mod;
		}
	}
	cout << a[n] << endl;
	return 0;
}