#include <iostream>
#include <fstream>

using namespace std;

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

const int mod = 666013;
int a[5][5], b[5][5];

void init(){
    a[1][1] = 0;
    a[1][2] = 1;
    b[1][2] = 1;
    b[2][1] = 1;
    b[2][2] = 1;
}

void inmul(int a[5][5], int b[5][5]){
    int c[5][5];
    for (int i = 1; i <= 2; i++)
        for (int j = 1; j  <= 2; j++)
            c[i][j] = 0;
    for (int i = 1; i <= 2; i++)
        for (int j = 1; j <= 2; j++)
            for (int k = 1; k <= 2; k++)
                c[i][j] = (c[i][j] + 1LL * a[i][k] * b[k][j]) % mod;
    for (int i = 1; i <= 2; i++)
        for (int j = 1; j <= 2; j++)
            a[i][j] = c[i][j];
}

void put(int n){
    while (n){
        if (n % 2 == 1)
            inmul(a, b);
        inmul(b, b);
        n = n / 2;
    }
}

int main()
{
    int k;
    fin >> k;
    init();
    put(k - 1);
    fout << a[1][2] << '\n';
    return  0;
}