#include<cstdio>
#include<cstdlib>
#include<ctime>
#include<iostream>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<vector>
using namespace std;

const char IN[] = {"sortari2.in"};
const char OUT[] = {"sortari2.out"};
const int INF = 1000000005;
const double PI  = 3.14159265;
const int NMAX = 1005;
const int MOD = 999017;

#define II inline
#define LL long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define FOR(i, a, b) 	for(int i = a ; i <= b ; i++)
#define IFOR(i, a, b) 	for(int i = a ; i >= b ; i--)
#define FORIT(it, V) 	for(vector<int> :: iterator it = V.begin() ; it != V.end() ; it++)
#define all(a) a, a + 

int N;
int fact = 1;
int fib[2 * NMAX];

void rezolv()
{
	FOR(i, 1, N)
		fact = (fact * i) % MOD;
	fib[1] = 1;
	FOR(i, 2, 2*N - 1)
		fib[i] = (fib[i - 1] + fib[i - 2])%MOD;
}

int main()
{
	freopen(IN, "r", stdin);
	freopen(OUT, "w", stdout);
	scanf("%d", &N);
	rezolv();
	printf("%d\n", (fact - fib[2*N - 1] + MOD) % MOD);
	return 0;
}