#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int mod = 666013;

int i, k, e, z[3][3], sol[3][3], aux[3][3];

void Mult(int c[][3], int a[][3], int b[][3])
{
    for(int i = 1; i <= 2; i++)
        for(int j = 1; j <= 2; j++)
            for(int k = 1; k <= 2; k++)
                c[i][j] = (c[i][j] + 1LL * a[i][k] * b[k][j]) % mod;
}
int main()
{
    freopen("kfib.in", "r", stdin);
    freopen("kfib.out", "w", stdout);

    scanf("%d", &k);
    e = k - 1;

    z[1][2] = z[2][1] = z[2][2] = 1;
    sol[1][1] = sol[2][2] = 1;

    for(i = 1; i <= e; i <<= 1)
    {
        if(i & e)
        {
            memset(aux, 0, sizeof(aux));
            Mult(aux, sol, z);
            memcpy(sol, aux, sizeof(aux));
        }
        memset(aux, 0, sizeof(aux));
        Mult(aux, z, z);
        memcpy(z, aux, sizeof(aux));
    }

    printf("%d\n", sol[2][2]);

    return 0;
}