#include <bits/stdc++.h>
#define MOD 666013

using namespace std;

ifstream fin("kfib.in");
ofstream fout("kfib.out");

map<int, int> dp;
int fib(int n) {
    if (n == 1 || n == 2)
        return 1;
    if (dp.count(n))
        return dp[n];
    dp[n] = (fib(n - 2) + fib(n - 1)) % MOD;
    return dp[n];
}

int main() {
    int n;
    fin >> n;
    fout << fib(n);
    return 0;
}