/*
    Look at me!
    Look at me!
    Look at how large the monster inside me has become!
*/

#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#define f cin
#define g cout
#include<queue>
#define INF 0x3f3f3f3f
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ld long double
#define ll long long
#define ull unsigned long long
#define eps 1.e-7
#define BUFMAX 10100100
#define N 8000100
#define mod 666013
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/

ll D[N],sol,P[N],I[N];
int n;

int main ()
{
    #ifndef ONLINE_JUDGE
    freopen("a.in","r",stdin);
    freopen("a.out","w",stdout);
    #endif

    f>>n;
    ll r=2LL*n*(2*n-1)%mod;
    ll r2=1LL*n*(n-1)%mod;
    FOR(i,2,n)
    {
        D[i]=r;
        D[i]-=2*r2;
        r=r*(2*n-i)%mod;
        r2=r2*(n-i)%mod;
        sol+=D[i];
        sol%=mod;
    }
    FOR(i,n+1,2*n)
    {
        D[i]=r;
        r=r*(2*n-i)%mod;
        sol+=D[i];
        sol%+mod;
    }
    if(sol<0)
        sol+=mod;
    g<<sol;
    return 0;
}