#include <fstream>

using namespace std;

const int MOD = 666013;
const int N = 2;

void produs(int a[N][N], int b[N][N])
{
    int p[N][N];
    for (int i = 0; i < N; i++)
    {
        for (int k = 0; k < N; k++)
        {
            p[i][k] = 0;
            for (int j = 0; j < N; j++)
            {
                p[i][k] += (long long)a[i][j] * b[j][k] % MOD;
                p[i][k] %= MOD;
            }
        }
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            a[i][j] = p[i][j];
        }
    }
}

int main()
{
    ifstream in("kfib.in");
    ofstream out("kfib.out");
    int n;
    in >> n;
    int p[N][N] = {{1, 0}, {0, 1}};
    int a[N][N] = {{1, 1}, {1, 0}};
    n--;
    while (n != 0)
    {
        if (n % 2 != 0)
        {
            produs(p, a);
        }
        produs(a, a);
        n /= 2;
    }
    out << p[0][0] << "\n";
    in.close();
    out.close();
    return 0;
}