#include <bits/stdc++.h>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef pair<LL,LL> PLL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

LL N, M;

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  cin >> N >> M;
  vector<LL> fib(N);
  fib[0] = fib[1] = 1;
  REP(i,N-2) fib[i+2] = fib[i+1] + fib[i];
  //  REP(i,N) cout << fib[i] << " "; cout << endl;
  
  LL D = fib[N-1] - M;
  LL ans = 0;
  for(int i=N-3;i>=0;--i)
	if(fib[i] <= D)
	  D -= fib[i], ++ans;
  if(D != 0) ans = -1;
  cout << ans << endl;

  return 0;
}