#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "kfib.in";
const char outfile[] = "kfib.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 100005;
const int oo = 0x3f3f3f3f;
const int MOD = 666013;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

int K;
int Z[3][3], Ans[3][3];

/// M[i] = M[1] * Z[ i - 1 ];

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

inline void lgPow(int P, int Ans[3][3]) {
    Ans[0][0] = Ans[1][1] = 1;
    int aux[3][3];
    for( ; P ; P >>= 1) {
        if(P & 1) {
            memset(aux, 0, sizeof(aux));
            Multiply(Ans, Z, aux);
            memcpy(Ans, aux, sizeof(aux));
        }
        memset(aux, 0, sizeof(aux));
        Multiply(Z, Z, aux);
        memcpy(Z, aux, sizeof(aux));
    }
}

int main() {
    fin >> K;
    Z[0][0] = 0; Z[0][1] = 1;
    Z[1][0] = 1; Z[1][1] = 1;
    lgPow(K - 1, Ans);
    fout << Ans[1][1] << '\n';
    fin.close();
    fout.close();
    return 0;
}