#include<bits/stdc++.h>
using namespace std;

ifstream f("kfib.in");
ofstream g("kfib.out");

const int MOD = 666013;
const int N_MAX = 100000;

long long n, m[N_MAX];

long long Fib(int n)
{
    if( n <= 1)
        return n;
    if( m[n] == NULL )
        m[n] = Fib(n-1) + Fib(n-2);
    return m[n];
}

int main()
{
    f >> n;
    m[0] = 0; m[1] = 1;
    g << Fib(n) % MOD;
    return 0;
}