#include <cstdio>
#include <algorithm>
using namespace std;
int putere(int a,int b,int mod)
{
    int result=1;
    while(b)
    {
        if(b&1) result=(result*a)%mod;
        b>>=1;
        a=(a*a)%mod;
    }
    return result;
}
int main()
{
    //freopen("in","r",stdin);
    //freopen("out","w",stdout);
    int n,i,sol=0,pas,mod=666013;
    scanf("%d",&n);
    int fact=1;
    int comb=(2*n)%mod,comb1=n;
    n=n*2;
    for(i=2;i<=n;i++)
    {
        fact=(1LL*fact*i)%mod;
        comb=(1LL*comb*(n-i+1))%mod;
        pas=putere(i,mod-2,mod);
        comb=(1LL*comb*pas)%mod;
        if(i<=n/2)
        {
        comb1=(1LL*comb1*(n/2-i+1))%mod;
        comb1=(1LL*comb1*pas)%mod;
        }
        if(i<=n/2) sol=(mod+sol+((mod+comb-2*comb1)%mod)*fact)%mod;
        else sol=(sol+1LL*comb*fact)%mod;

    }
    printf("%I64d",sol);
}