// By Stefan Radu

#include <algorithm>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <string>
#include <cctype>
#include <queue>
#include <deque>
#include <cmath>
#include <stack>
#include <map>
#include <set>

using namespace std;

#define sz(x) (int)(x).size()

typedef pair < int, int > pii;
typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector < vector < int > > vvi;

ifstream cin("kfib.in");
ofstream cout("kfib.out");

const int MOD = 666013;

vvi a {{0, 1}, {1, 1}};

vvi mult(vvi a, vvi b) {

  vvi ret {{0, 0}, {0, 0}};
  for (int i = 0; i < 2; ++ i) {
    for (int j = 0; j < 2; ++ j) {
      for (int k = 0; k < 2; ++ k) {
        ret[i][j] = (1ll * ret[i][j] + 1ll * a[i][k] * b[k][j]) % MOD; 
      }
    }
  }

  return ret;
}

vvi raise(vvi k, int b) {

  vvi ans = {{1, 0}, {0, 1}};
  while (b) {

    if (b & 1) ans = mult(ans, k);

    k = mult(k, k);
    b >>= 1;
  }

  return ans;
}

int main() {

#ifdef STEF
  freopen("input", "r", stdin);
  freopen("output", "w", stdout);
#endif

  ios::sync_with_stdio(false);
  cin.tie(0);cout.tie(0);

  int n;
  cin >> n;

  a = raise(a, n);

  cout << a[1][0] << '\n';
}