#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
ll M;

ll A[100];
ll B[100];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>M;
	
	A[1]=A[2]=1;
	B[1]=1;
	for(i=3;i<=90;i++) A[i]=A[i-1]+A[i-2];
	for(i=2;i<=90;i++) B[i]=B[i-1]+B[i-2];
	
	ll diff=A[N]-M;
	if(diff<0) return _P("-1\n");
	vector<ll> V;
	for(i=3;i<=N;i++) V.push_back(B[N-i+1]);
	
	int num=0;
	sort(ALL(V));
	reverse(ALL(V));
	FORR(r,V) {
		if(r<=diff) diff -= r, num++;
	}
	if(diff) return _P("-1\n");
	_P("%d\n",num);
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}