#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define FILL(x,y) memset(x,y,sizeof(x))
#define COPY(x,y) memcpy(x,y,sizeof(x))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define MAX(a,b) (((a)>(b))?(a):(b))
#define x first
#define y second
#define st first
#define nd second
#define pb push_back
#define nleft (n<<1)
#define nright (nleft+1)

#include<string.h>
#include<vector>

using namespace std;
#include<fstream>
ifstream cin("kfib.in");
ofstream cout("kfib.out");

const int NMAX = 5;
const int MOD = 666013;
const int INF = 0x3f3f3f3f;
const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef pair<K, K> PKK;
typedef vector<int> VI;

int n,m,i,j;

void mul(int A[2][2], int B[2][2], int C[2][2])
{
	REP(i,2)
		REP(j,2)
			REP(k,2)
				C[i][j]=(C[i][j] + 1LL*A[i][k]*B[k][j])%MOD;
}

int exp(int p)
{
	int X[2][2];
	memset(X,0,sizeof(X));
	X[0][0]=1;X[1][1]=1;
	
	int N[2][2];
	memset(N,0,sizeof(N));
	N[0][1]=1;N[1][0]=1;N[1][1]=1;
	
	int AUX[2][2];
	memset(AUX,0,sizeof(AUX));
	
	while(p)
	{
		
		if(p&1){
			mul(N,X,AUX);
			memcpy(X,AUX,sizeof(X));
			memset(AUX,0,sizeof(AUX));
			p--;	
		}
		mul(N,N,AUX);
		memcpy(N,AUX,sizeof(N));
			memset(AUX,0,sizeof(AUX));
		p/=2;
	}
	return X[1][1];
}

int main()
{
	cin>>n;
	if(n)
		cout<<exp(n-1);
	else 
		cout<<n;
	return 0;
}