#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 = 20;
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 T, N;
int NR;
int a[NMAX + 1];

int sorta1()
{
	int pasi = 0;
	int b[NMAX + 1];
	
	FOR(i, 1, N)	b[i] = a[i];
	FOR(i, 1, N)
		FOR(k, i, N)
			if(b[k] == i)
			{
				while(k != i)
				{
					swap(b[k], b[k - 1]);
					pasi++;
					k--;
				}
				break;
			}
	return pasi;
}

int sorta2()
{
	int pasi = 0;
	int b[NMAX + 1];
	
	FOR(i, 1, N)	b[i] = a[i];
	FOR(i, 1, N)
		FOR(k, i, N)
			if(b[k] == i)
			{
				if(k != i)
				{
					swap(b[k], b[i]);
					pasi++;
				}
				break;
			}
	return pasi;
}

int main()
{
	freopen(IN, "r", stdin);
	freopen(OUT, "w", stdout);
	//scanf("%d", &T);
	//FOR(i, 1, T)
	{
		scanf("%d\n", &N);
		
		FOR(i, 1, N)	a[i] = i;
		do{
			if(sorta1() != sorta2())	NR++;
			NR %= MOD;
		}while(next_permutation(a + 1, a + N + 1));
			
		printf("%d\n", NR);
		NR = 0;
	}
	return 0;
}