using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)

#define IN "sortari2.in"
#define OUT "sortari2.out"
#define N_MAX (1<<10)
#define Mod 999017

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int N;

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	
	scanf("%d",&N);
}

II void solve()
{
	int Sol(0),Nfact(1),Fibo(0),LastFibo(1);
	
	FOR(i,2,N)
	{
		int aux = (Fibo + LastFibo) % Mod;
		LastFibo = Fibo;
		Fibo = aux;
		aux = (Fibo + LastFibo) % Mod;
		LastFibo = Fibo;
		Fibo = aux;
		
		Nfact = (Nfact * i) % Mod;
		Sol = Nfact - Fibo - LastFibo;
	}
	
	for(;Sol < 0;Sol += Mod);
	printf("%d\n",Sol);
}

int main()
{
	scan();
	solve();
	return 0;
}