//A tree without skin will surely die.
//A man without face is invincible.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif


ll MOD=100007;

const ll MAX_N=5e3;
ll dp[MAX_N][2];

ll add(ll a, ll b)
{
	return (a+b)%MOD;
}

// 0 0 1 5 19 65 210 654 1985
int solve()
{
	ll n;
	if(!(cin>>n))return 1;
	dp[2][0]=2;
	dp[3][0]=3;

	dp[2][1]=0;
	dp[3][1]=1;
	
	FOR(i,4,n+1)
	{
		dp[i][0]=2*dp[i-1][0]%MOD;
		FOR(j,2,i-1)dp[i][0]=add(dp[i][0],dp[j][0]);

		dp[i][1]=add(dp[i-1][0],2*dp[i-1][1]);
		FOR(j,2,i-1)dp[i][1]=add(dp[i][1],dp[j][1]);
	}
	cout<<dp[n][1]<<'\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
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}