#include <bits/stdc++.h>

using namespace std;
ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int mod = 666013;
int k;
int a[3][3],b[3][3];

inline void Copiere(int a[3][3], int b[3][3])
{
    for(int i = 1; i <= 2; i++)
        for(int j = 1; j <= 2; j++)
            a[i][j] = b[i][j];
}

inline void Inmultire(int a[3][3], int b[3][3])
{
    int c[3][3];
    int i, j, k;
    long long s;
    for(i = 1; i <= 2; i++)
        for(j = 1; j <= 2; j++)
        {
            s = 0;
            for(k = 1; k <= 2; k++)
                s += (1LL* a[i][k] * b[k][j]);
            c[i][j] = s % mod;
        }
    Copiere(a, c);
}

inline void LogPow(int a[3][3],int n)
{
    int b[3][3];
    b[1][1] = 0;
    b[1][2] = b[2][1] = b[2][2] = 1;
    while(n)
    {
        if(n % 2 == 1)
            Inmultire(b, a);
        Inmultire(a, a);
        n /= 2;
    }
    Copiere(a, b);
}


int main()
{
    fin >> k;
    a[1][2] = 1;
    b[1][2] = b[2][1] = b[2][2] = 1;
    if(k == 0) fout << "0\n";
    else
    {
        LogPow(b,k-1);
        Inmultire(a,b);
        fout << a[1][1] << "\n";
    }
    fout.close();
    return 0;
}