#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__",", __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 1120000000

long fib[100];

int main(){
  int n; long m;
  cin>>n>>m;
  fib[0]=0;
  fib[1]=1;
  rep(i,n) fib[i+2]=fib[i+1]+fib[i];
  long d = fib[n] - m;
  if(d<0) cout << -1 << endl;
  else if(d==0) cout << 0 << endl;
  else {
    int cnt = 0;
    for(int i=n-2; i>0; i--){
      if(d - fib[i]>=0){
        d -= fib[i];
        cnt++;
      }
    }
    if(d==0) cout << cnt << endl;
    else cout << -1 << endl;
  }

  return 0;
}