#include <cstdio>

using namespace std;

const int MAXN = 100010;
const int mod = 10007;

int N;
int dp[ MAXN ];
int P[ MAXN ];

int main( void )
{
    scanf( "%d", &N );

    P[0] = dp[0] = 1;

    for( int i = 1; i <= N; ++i ) {
        int x = i-1;
        dp[i] = 0;

        for( int l = 1; x >= 0; ++l ) {
            dp[i] += P[x]; if( dp[i] >= mod ) dp[i] -= mod;
            
            if( x-l >= 0 ) {
                dp[i] -= P[x-l]; 
                if( dp[i] < 0 ) dp[i] += mod;
            }

            x -= 2*l;
        }

        P[i] = dp[i] + P[i-1];
        if( P[i] >= mod ) P[i] -= mod;
    }

    printf( "%d\n", dp[N] );
    return (0-0);
}