#include<iostream>
#include<fstream>
using namespace std;

ifstream f("sortari2.in");
ofstream g("sortari2.out");

#define MaxN 1010
#define MOD 999017

int N,Perm,Sol;
int Best[MaxN*2] = {1};

int main()
{
    f >> N;

    Perm = 1;
    for(int i=1;i<=N;i++)
        Perm = (1LL*Perm*i)%MOD;

    for(int i=1;i<=(N<<1);i++)
        Best[i] = (Best[i-1]+Best[i-2])%MOD;

    for(int i=1;i<N;i++)
        Sol = Best[(i<<1)-1];
    Sol += (N<<1)-3;

    g << (Perm-Sol+MOD)%MOD;
}