#include <fstream>
#define mod 666013
#define BIG 2000001
using namespace std;
int a[BIG];
int main() {
    int k,n,i=2;
    a[1]=a[2] = 1;
    ifstream fin("kfib.in");
    ofstream fout("kfib.out");
    fin>>k;
    fin.close();
    if(k<30)
        fout<<k;
    else{
  while(!(a[i]==1&&!a[i-1]))i++,a[i] = (a[i-1] + a[i-2]) % mod;
        n=i-1;
        fout<<a[k%n];
    }
    fout.close();
    return 0;
}