#include<fstream>
#include<iostream>
using namespace std;
#define mod 666013
long long k;
inline void mult(int A[][3], int B[][3], int C[][3]) {
	int i, j, k;
	for (i = 0; i < 2; i++)
		for (j = 0; j < 2; j++)
			for (k = 0; k < 2; k++)
				C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % mod;
 
}
inline void fact(int P, int M[][3]) {
	int C[3][3], AUX[3][3], i;
	C[0][0]=0;
	C[0][1]=1;
	C[1][0]=1;
	C[1][1]=1;
	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 m[3][3];
int main(){
	ifstream f("kfib.in");
	ofstream g("kfib.out");
	f>>k;
	fact(k,m);
	g<<m[0][1];
	return 0;
}