#include<bits/stdc++.h>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;  
#define DEB cout<<"!"<<endl
#define SHOW(a,b) cout<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cout<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
  
#define DIV 1000000007
typedef vector<ll> Array;
typedef vector<Array> matrix;

typedef tuple<int,int,int> tiii;
#define mt make_tuple

int dp[100002] = {};

int main(){
  ll k_sum = 1;
  ll g_sum = 0;
  int n; cin >> n;
  if(n == 1){cout << 1 << endl;return 0;}
  for(int i = 2; i < n; i++){
    if(i%2 == 0)
      g_sum += k_sum*i %DIV;
    else
      k_sum += g_sum*i %DIV;
  }
  ll ans = 0;
  if(n%2==0)
    ans = n*k_sum;
  else
    ans = n*g_sum;
  cout << ans %DIV << endl;
  return 0;
}