/*
sirul lui fibonacci infoarena
*/
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>

using namespace std;

#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define Y second

#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(LL i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))

#define IN_FILE "kfib.in"
#define OUT_FILE "kfib.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);

//variables
LL n;
pair<LL ,LL > last;
//other functions
void reading()
{
	f >> n;
	f.close();
}
void solving()
{
	last.X = 1;
	last.Y = 1;
	LL aux;
	int start = 2;
	/*if (n > 100000000)
	{
		/*start = 100000;
		last.X = 342373;
		last.Y = 641092;
	}*/
	if (n >= 5000000)
	{
		start = 5000001;
		last.X = 24750;
		last.Y = 453621;
		aux = last.X + last.Y;
	}
	else if (n >= 1000000)
	{
		start = 1000001;
		last.X = 422901;
		last.Y = 426076;
		aux = last.X + last.Y;
	}
	else if (n >= 200000)
	{
		start = 200001;
		last.X = 342373;
		last.Y = 641092;
		aux = last.X + last.Y;
	}
	else if (n >= 100000)
	{
		start = 100001;
		last.X = 378917;
		last.Y = 649241;
		aux = last.X + last.Y;
	}
	FOR(i, start, n-1)
	{
		aux = last.X + last.Y;
		aux %= 666013;
		last.X = last.Y;
		last.Y = aux;
	}
	g << aux;
}
void write_data()
{
}
int start;
int main()
{
	start = clock();
	reading();
	solving();
	write_data();
	g << "\n\n\Timp:";
	g << clock() - start;
}