#include <cstdio>
#include <cstring>
#define mod 666013

using namespace std;

int N, i;
int MAT[3][3], SOL[3][3];

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_power(int P, int M[][3]) {
    if(P == 0) {
        M[0][0] = M[1][1] = 1;
        M[0][1] = M[1][0] = 0;
        return ;
    }

    lg_power(P / 2, M);

    if(P % 2 == 1) {
        int A[3][3];
        A[0][0] = 0; A[0][1] = 1; A[1][0] = 1; A[1][1] = 1;

        int S[3][3];
        S[0][0] = S[0][1] = S[1][0] = S[1][1] = 0;

        mult(M, M, S); /// S = M^2

        M[0][0] = M[0][1] = M[1][0] = M[1][1] = 0;
        mult(S, A, M); /// M = S * A
    }
    else {
        int S[3][3];
        S[0][0] = S[0][1] = S[1][0] = S[1][1] = 0;

        mult(M, M, S); /// S = M^2
        for(int i = 0; i < 2; i++) {
            for(int j = 0; j < 2;j++) {
                M[i][j] = S[i][j];
            }
        }
    }
}

int main() {
    scanf("%d", &N);

    MAT[0][0] = 0; MAT[0][1] = 1; MAT[1][0] = 1; MAT[1][1] = 1;

    lg_power(N - 1, SOL);

    printf("%d\n", SOL[1][1]);

    return 0;
}