#include <bits/stdc++.h>
#define N 1005
#define MOD 999017
using namespace std;

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

long long int dp[N][N] , fact , c[N] , sol[N] ;

int main()
{
    int n , i , j ;
    fin >> n ;
    fact = 1 ;
    for ( i = 2 ; i <= n ; i++ )
        fact = (fact*i)%MOD ;
    c[1] = 1;
    c[2] = 1 ;
    for ( i = 3 ; i <= n ; i++ )
        c[i] = (c[i-1]*2)%MOD ;
    sol[0] = 1 ;
    for ( i = 1 ; i <= n ; i++ )
        for ( j = 1 ; j <= i ; j++ )
            sol[i] = (sol[i] + sol[i-j]*c[j])%MOD ;
    fact = (fact+MOD-sol[n])%MOD ;
    fout << fact;
}