import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N;
long M;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readLong();
      auto F = new long[N + 1];
      F[0] = 0;
      F[1] = 1;
      foreach (i; 2 .. N + 1) {
        F[i] = F[i - 1] + F[i - 2];
      }
      debug {
        writeln("F = ", F);
      }
      long m = M;
      int ans;
      foreach (i; 3 .. N + 1) {
        if (m + F[N - i + 1] <= F[N]) {
          m += F[N - i + 1];
          ++ans;
        }
      }
      if (m == F[N]) {
        writeln(ans);
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}