#include <cmath> #include <vector> #include <list> #include <map> #include <set> #include <functional> #include <queue> #include <iostream> #include <string.h> #include <iomanip> #include <algorithm> #include <functional> #include <cstdint> #include <climits> #include <unordered_set> #include <sstream> #include <stack> using namespace std; typedef long long int ll; typedef pair<int,int> pii; int main() { const ll mod = 1e9 + 7; ll n; cin >> n; vector<ll> odd; vector<ll> even; vector<ll> oddSum; vector<ll> evenSum; odd.push_back(1); oddSum.push_back(1); even.push_back(0); evenSum.push_back(0); for(int i = 2;i <= n;i++) { if(i % 2 == 0) { ll next = (oddSum.back() * i) % mod; even.push_back(next); evenSum.push_back((evenSum.back() + next) % mod); } else { ll next = (evenSum.back() * i) % mod; odd.push_back(next); oddSum.push_back((oddSum.back() + next) % mod); } } if(n % 2 == 0) { cout << even.back() << endl; } else { cout << odd.back() << endl; } return 0; }