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

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;

const int N = 4047;
const int MOD = 100007;
ll dp[N][2];

ll add(ll a, ll b)
{
	return a + b >= MOD ? a + b - MOD : a + b;
}

ll mult(ll a, ll b)
{
	return a * b % MOD;
}

struct DSU
{
	vector<int> par;
	int n;
	int comps;
	
	DSU (int _n, const vector<pii>& ed)
	{
		n = _n;
		par.resize(n);
		iota(all(par), 0);
		comps = n;
		
		for (const auto& [a, b]: ed)
		{
			union_sets(a, b);
		}
		
		//if (comps == 1)
		//{
			//for (const auto& [a, b]: ed)
			//{
				//cerr << a + 1 << ' ' << b + 1 << '\n';
			//}
			//cerr << "=========================\n";
		//}
	}

	int find_set(int v) 
	{
		if (v == par[v])
			return v;
		return par[v] = find_set(par[v]);
	}

	void union_sets(int a, int b) 
	{
		a = find_set(a);
		b = find_set(b);
		if (a != b)
		{
			par[b] = a;
			comps--;
		}
	}
};

int solve()
{
	int n;
	if (!(cin >> n))
		return 1;
	
	for (auto& i: dp)
		for (auto& ii: i)
			ii = 0;
	--n;
	
	//vector<pii> ed;
	//FOR (i, 1, n)
	//{
		//ed.pb({i - 1, i});
	//}
	//FOR (i, 0, n)
	//{
		//ed.pb({i, n});
	//}
	
	//int m = sz(ed);
	//assert(m == 2 * n - 1);
	//int ans = 0;
	//int cnt = 0;
	//FOR (mask, 1, 1 << m)
	//{
		//int p = popcount((unsigned int)mask);
		//if (p != n + 1)
			//continue;
		
		//cnt++;
		//vector<pii> ce;
		//FOR (i, 0, m)
		//{
			//if (mask & 1 << i)
			//{
				//ce.pb(ed[i]);
			//}
		//}
		//DSU ds(n + 1, ce);
		//ans += ds.comps == 1;
	//}
	//cerr << cnt << '\n';
	//cout << ans << "\n";
	
	dp[0][1] = 1;
	FOR (i, 1, n + 2)
	{
		dp[i][0] = add(dp[i - 1][0], dp[i - 1][1]);
		dp[i][1] = add(dp[i][0], dp[i - 1][1]);
	}
	
	ll ans = 0;
	FOR (i, 0, n)
	{
		FOR (j, i + 1, n)
		{
			ans = add(ans, mult(dp[i][1], dp[n - j - 1][1]));
		}
	}
	cout << ans << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}