#include #define rep(i,n) for(int i=0;i<(int)(n);i++) using namespace std; using ll = long long ; using P = pair ; using pll = pair; constexpr int INF = 1e9; constexpr long long LINF = 1e17; constexpr int MOD = 1000000007; ll dp[100005]; int main(){ dp[1] = 1; int n; cin >> n; ll odd = 1; ll even = 0; for(int i=2;i<=n;i++){ if(i%2==0){ dp[i] = (odd * i)%MOD; even = (even + dp[i])%MOD; }else{ dp[i] = (even * i)%MOD; odd = (odd + dp[i])%MOD; } } cout << dp[n] << endl; }