#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

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

void add(int x1, int x2, int y1, int y2, int idx, ll v) {
	if(x2 < x1 || y2 < y1) return;
	ADD(dp[x2 + 1][y2 + 1][idx], v);
	ADD(dp[x2 + 1][y1][idx], mod - v);
	ADD(dp[x1][y2 + 1][idx], mod - v);
	ADD(dp[x1][y1][idx], v);
}

void show() {
	rep(k, 0, 2) {
		rep(i, 1, N + 1) {
			vl vec;
			rep(j, 1, N + 1) vec.pb(dp[i][j][k]);
			debug(vec);
		}
		debug("-----------------");
	}
}

void solve() {
	cin >> N;
	for(int i = 1; i <= N; i++) {
		add(1, 1, i, i, 0, 1);
	}
	for(int i = 1; i <= N; i++) {
		for(int j = 1; j <= N; j++) {
			for(int k = 0; k < 2; k++) {
				ADD(dp[i][j][k], 
						dp[i][j - 1][k] + dp[i - 1][j][k] - dp[i - 1][j - 1][k] + mod);
			}
			if(N == i) continue;
			//k = 0
			int at = N + i - j;
			add(i + 1, min(at, N), j + 1, N, 0, dp[i][j][0]);
			add(min(at, N), min(at, N), j, j, 1, dp[i][j][0]);

			//k = 1
			add(i + 1, i + 1, j + 1, N, 0, dp[i][j][1]);
			add(i + 1, i + 1, j - 1, j, 1, dp[i][j][1]);
		}
	}
	ll res = 0;
	for(int i = 1; i <= N; i++) {
		rep(k, 0, 2) {
			ADD(res, dp[N][i][k]);
		}
	}
	cout << res << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}