#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
ll sum[2][100000];
main(){
    int N;
    cin >> N;
    sum[0][0] = 1;//odd
    sum[1][0] = 2;//even
    for(int i = 1;i <= N/2;i++){
        sum[0][i] = (sum[0][i-1] + sum[1][i-1] * (i*2+1)) % MOD;
        sum[1][i] = (sum[1][i-1] + sum[0][i] * (i*2+2)) % MOD;
    }
    //odd
    if(N == 1)cout << 1 << endl;
    else if(N == 2)cout << 2 << endl;
    else if(N % 2)cout << (sum[0][N/2] - sum[0][N/2-1] + MOD) % MOD << endl;
    else cout << (sum[1][(N-1)/2] - sum[1][(N-1)/2-1] + MOD) % MOD << endl; 
}