//ALEXANDRU MICLEA

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

using namespace std;

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

int MOD = 666013;
const long long nrmare = 15000000;
long long val[nrmare];

int main() {

	int n;
	cin >> n;

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

	cout << val[n % p];

	return 0;
}