#include <bits/stdc++.h>

using namespace std;

ifstream fin("kfib.in");
ofstream fout("kfib.out");
const int mod = 666013;
long long mat[2][2] = {{0, 1}, {1, 1}};
long long fibo[2][2] = {{1, 0}, {0, 1}};
long long n;

static inline void Prod(long long a[2][2], long long b[2][2]) {
    long long c[2][2] = {{0, 0}, {0, 0}};
    for(int i : {0, 1}) {
        for(int j : {0, 1}) {
            for(int k : {0, 1}) c[i][j] += a[i][k] * b[k][j];
        }
    }
    for(int i : {0, 1}) {
        for(int j : {0, 1}) a[i][j] = c[i][j] % mod;
    }
}

int main() {
    fin >> n;
    n--;
    while(n) {
        if(n & 1) Prod(fibo, mat);
        Prod(mat, mat);
        n >>= 1;
    }
    fout << fibo[1][1];

    return 0;
}