#include <cstdio>
#include <cstring>
#define modulo 666013

using namespace std;
int n,i;
int mat[3][3], sol[3][3];

void mult(int A[][3], int B[][3], int C[][3]) {
	for (int i = 0; i < 2; i++)
		for (int j = 0; j < 2; j++)
			for (int k = 0; k < 2; k++)
				C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % modulo;
}

void lg_put(int p, int m[][3]) {
	int C[3][3], AUX[3][3], i;

	memcpy(C, mat, sizeof(mat));
	m[0][0] = m[1][1] = 1;

	for (i = 0; (1 << i) <= p; i++) {
		if (p & (1 << i)) {
			memset(AUX, 0, sizeof(AUX));
			mult(m, C, AUX);
			memcpy(m, AUX, sizeof(AUX));
		}
		memset(AUX, 0, sizeof(AUX));
		mult(C, C, AUX);
		memcpy(C, AUX, sizeof(C));
	}
}


int main()
{
freopen ("kfib.in","r",stdin);
freopen ("kfib.out","w",stdout);

scanf("%d",&n);
mat[0][0]=0;
mat[0][1]=1;
mat[1][0]=1;
mat[1][1]=1;

lg_put(n-1,sol);
printf("%d",sol[1][1]);
return 0;
}