#include <bits/stdc++.h>

using namespace std;

#define ll long long

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

const int n = 2, m = 2, mod = 666013;

void inmultireMatrix(int a[n][m], int b[n][m], int rez[n][m]){
    ll tmp[n][m];
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            tmp[i][j] = 0;
            for(int k = 0 ; k < m; k++){
                tmp[i][j]+=((ll)a[i][k] * (ll)b[k][j]) % mod;
            }
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0 ; j < m; j++){
            rez[i][j] = tmp[i][j];
        }
    }
}

int lgput(int k, int a[n][m], int b[n][m]){
    if(k == 0){
        return 0;
    }
    else if(k % 2 == 0){
        inmultireMatrix(a, a, a);
        return lgput(k / 2, a, b);
    }
    else{
        inmultireMatrix(b, a, b);
        inmultireMatrix(a, a, a);
        return lgput(k / 2, a, b);
    }
    
}

int main(){
    int k;
    fin>>k;
    int ans[2][2]={{1, 0}, {0, 1}};
    int z[2][2]={{1, 1}, {1, 0}};
    lgput(k - 1, z, ans);
    fout<<ans[0][0] % mod<<"\n";
    return 0;
}