#include <fstream>
using namespace std;
#define mod 666013;

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

long long k;

int fibonacci(long long k)
{
    int f0, f1, fn;
    f0=0;f1=1;int n=2;
    while (n<=k)
    {
        fn=(f1+f0)%mod;
        f0=f1;
        f1=fn;
        n++;
    }
    return fn%mod;
}

int main()
{
    f >> k;
    g << fibonacci(k);
}