#include <cstdio>
#include <cstdlib>
#include <iostream>

using namespace std;
typedef long long ll;

ll fib[1000], n;
int k;


int main(void) {
  cin >> n;
  
  fib[0] = 1;
  fib[1] = 2;
  k = 2;
  
  for ( ;; ) {
    fib[k] = fib[k - 1] + fib[k - 2];
    if ( fib[k] > n ) break;
    ++k;
  }
  
  for (;;) {
    while ( fib[k] > n ) --k;
    if ( fib[k] == n ) { cout << n << '\n'; break; }
    n -= fib[k];
  }
  return 0;
}