#include <iostream>

#define mod 666013
#define lint long long int
using namespace std;

int ans (int n) {
    int rez = 0;
    int cur = 1;

    for (int i = n; i; i--) {
        cur = (1ll * cur * i) % mod;
        rez += cur;

        if (rez >= mod)
            rez -= mod;
    }

    return rez;
}

int main()
{
    int n = 2;
    cin >> n;

    int r = (ans(2 * n) - (2 * ans(n)) % mod + 2 * mod) % mod;

    cout << r << '\n';
    return 0;
}