#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "kfib"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		//freopen("test.out","w",stdout);
	}
}

#define MAX  666013
#define INF 0xffffff

int p;
long long f[2][2] = {{0,1},{1,1}}, r[2][2] = {{0,1},{1,1}}, x[2][2] = {{0,1},{1,1}};

void pow(int p)
{
	if(p>1)
	{
		pow(p/2);
		for(int i=0;i<2;i++)
			for(int j=0;j<2;j++){x[i][j] = r[i][j];r[i][j]=0;}
		for(int i=0;i<2;i++)
			for(int j=0;j<2;j++)
				for(int k=0;k<2;k++)r[i][j] = (r[i][j] + x[i][k] * x[k][j])%MAX;
		if(p%2)
		{
			for(int i=0;i<2;i++)
				for(int j=0;j<2;j++){x[i][j] = r[i][j];r[i][j]=0;}
			for(int i=0;i<2;i++)
				for(int j=0;j<2;j++)
					for(int k=0;k<2;k++)r[i][j] = (r[i][j] + x[i][k] * f[k][j])%MAX;
		}
	}
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
		scanf("%d",&p);
		pow(p+1);
		printf("%d\n",r[0][0]);
	return 0;
}