#include <bits/stdc++.h>

using namespace std;

#define mod 666013

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

int Mat[3][3], sol[3][3], n;

inline void mult(int A[][3], int B[][3], int C[][3]) {
    int i, j, k;
    for (i = 0; i < 2; i++)
        for (j = 0; j < 2; j++)
            for (k = 0; k < 2; k++)
                C[i][j] = (C[i][j] + 1LL * A[i][k] * B[k][j]) % mod;

}

inline void lg_put(int P, int M[][3]){

    int C[3][3], AUX[3][3],i;

    memcpy(C, Mat, sizeof(Mat));
    M[0][0] = M[1][1] = 1;

    for (i = 0; (1 << i) <= P; i++) {
        if (P & (1 << i)) {
            memset(AUX, 0, sizeof(AUX));
            mult(M, C, AUX);
            memcpy(M, AUX, sizeof(AUX));
        }

        memset(AUX, 0, sizeof(AUX));
        mult(C, C, AUX);
        memcpy(C, AUX, sizeof(C));
    }
}


int main()
{
    in>>n;
    Mat[0][0] = 0; Mat[0][1] = Mat[1][0] = Mat[1][1] = 1;
    lg_put(n-1, sol);
    out<<sol[1][1];
    return 0;
}