#include<bits/stdc++.h>

using namespace std;
 
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>

 
const int N = 2e5 + 100;
const int inf = 1e9;
const ll mod =  998244353;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    const int mod = 100007;

    vector dp(n + 1, vector(2, 0));
    dp[0][1] = 1;
    dp[1][0] = 1;
    dp[1][1] = 2;
    for (int i = 2; i <= n; i++) {
        dp[i][0] = (dp[i - 1][0] + dp[i - 1][1]) % mod;
        dp[i][1] = (dp[i - 1][0] + dp[i - 1][1] + dp[i - 1][1]) % mod;
    }

    
    n--;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            ans = (ans + (ll)dp[i][1] * dp[n - j - 1][1] % mod) % mod;
        }
    }
    cout << ans << endl;
    return 0;
}