//ALEX ENACHE

#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <unordered_map>
#include <time.h>
#include <iomanip>
#include <deque>
#include <math.h>
#include <assert.h>
#include <stack>
#include <bitset>
#include <random>

using namespace std;

//-----------------------------------------------------------------

#include <fstream>

//ifstream cin("input"); ofstream cout("output");
ifstream cin("kfib.in"); ofstream cout("kfib.out");

const int MOD = 666013;
const int NR_MARE = 1500000;
int fib[NR_MARE + 10];

int main() {

	int n;
	cin >> n;

	fib[0] = 0;
	fib[1] = 1;

	int p = -1;
	for (int i = 2; i <= NR_MARE; i++) {
		fib[i] = fib[i - 1] + fib[i - 2];
		fib[i] %= MOD;
		if (fib[i-1] == 0 && fib[i] == 1) {
			p = i - 1;
			break;
		}
	}

	cout << fib[n % p];

	return 0;
}