#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=666013;
const int MAXN=4000010;
ll mod_pow(ll num, ll pow)
{
    ll ret = 1;
    while (pow)
    {
        if (pow&1)
        {
            ret = (ret*num)%mod;
        }
        pow>>=1;
        num = (num*num)%mod;
    }
    return ret;
}
ll mod_inv(ll num)
{
    return mod_pow(num, mod-2);
}
ll fac[MAXN];
ll inv[MAXN];
ll one(int n)
{
    ll ret=0;
    for(int i=0;i<=n;i++)
    {
        ret+=inv[n+1-i];
        ret%=mod;
    }
    return ret;
}
int main()
{
    int n;
    scanf("%d",&n);
    inv[n+1]=1;
    for(int i=n;i>=0;i--)
    {
        inv[i]=inv[i+1]*i;
        inv[i]%=mod;
    }
    ll ans=1;
    ans-=2*one(n);
    n*=2;
    inv[n+1]=1;
    for(int i=n;i>=0;i--)
    {
        inv[i]=inv[i+1]*i;
        inv[i]%=mod;
    }
    ans+=one(n);
    ans+=5*mod;
    printf("%lld\n",ans%mod);
    return 0;
}