#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

#define MD 1000000007

int brute(int N){
  int i, j, k;
  int d[100];
  int res = 0;

  rep(i,N) d[i] = i;
  do{
    REP(i,1,N) if(d[i]==d[i-1]+2 || d[i]==d[i-1]-2) break;
    if(i<N) continue;
    res++;
  }while(next_permutation(d,d+N));

  return res;
}

int N;
ll dp[2][2][1111][1111];

ll solve(int f1, int f2, int num, int dame){
  int i, j, k, rest;
  ll res = 0;

  if(dp[f1][f2][num][dame] >= 0) return dp[f1][f2][num][dame];
  if(num==N){
    if(dame==0) res++;
    return dp[f1][f2][num][dame] = res;
  }

  rest = num+1;
  if(dame) res += (dame-f1-f2) * solve(f2, 0, num+1, dame-1);
  if(f2==1 && dame) res += solve(0, 0, num+1, dame-1);

  if(f1==0) res += 2*solve(f2, 1, num+1, dame+1);
  if(f1==1) res += solve(f2, 1, num+1, dame+1);
  if(f1==1) res += solve(f2, 1, num+1, dame);

  res += (num-1+f1-dame) * solve(f2, 0, num+1, dame);

  return dp[f1][f2][num][dame] = res % MD;
}

int main(){
  int i, j, k, l;
  ll res = 0;

  rep(i,2) rep(j,2) rep(k,1010) rep(l,1010) dp[i][j][k][l] = -1;
  reader(&N);
  if(N==1) res = 1;
  else     res = 2 * solve(0, 0, 2, 0) % MD;
  writerLn(res);

  return 0;
}