#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <queue>

#define maxn 8000100
#define inf (1<<30)
#define mod 666013
using namespace std;

ifstream fin("A.in");
ofstream fout("A.out");

long long n;

int main ()
{
    cin >> n;

    long long pw1 = 2*n*(2*n-1)%mod;
    long long pw2 = n*(n-1)%mod;

    long long ans = 0;

    for (int i = 2; i <= n*2; ++i)
    {
        ans = (ans + pw1 - 2*pw2)%mod;
        pw1 =pw1*(n*2-i)%mod;
        pw2 = pw2*(n-i)%mod;
        if (ans < 0)
            ans += mod;
    }

    cout << ans;
}