#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <time.h>
#include <random>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define LONG_INF 10000000000000000
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
map<long long, long long> wow;
long long rev(long long n) {
	if (wow[n] != 0) return wow[n];
	long long hoge = MAX_MOD-2;
	long long ans = 1;
	int hogehoge = n;
	while (hoge != 0){
		if (hoge % 2 == 1) {
			ans *= n;
			ans %= MAX_MOD;
		}
		n *= n;
		n %= MAX_MOD;
		hoge /= 2;
	}
	return wow[hogehoge] = ans;
}
long long compare(long long a, long long b) {
	long long ans = 1;
	for (long long i = 0;i < b;++i) {
		ans *= (a-i);
		ans %= MAX_MOD;
	}
	for (int i = 1;i <= b;++i) {
		ans *= rev(i);
		ans %= MAX_MOD;
	}
	return ans;
}
long long solve(long long n) {
	long long ans = 1;
	if (n == 1) return 1;
	if (n % 2 == 0) {
		ans *= solve(n / 2);
		ans *= ans;
		ans %= MAX_MOD;
		ans *= compare(n, n / 2);
		ans %= MAX_MOD;
		return ans;
	}
	else {
		ans *= solve(n / 2);
		ans *= ans;
		ans %= MAX_MOD;
		ans *= compare(n, n / 2);
		ans %= MAX_MOD;
		ans *= n - n/ 2;
		ans %= MAX_MOD;
		return ans;
	}
}
int main() {
	long long n;
	cin >> n;
	if (n >= MAX_MOD) {
		cout << 0 << endl;
		return 0;
	}
	cout << solve(n) << endl;
	return 0;
}