#include <bits/stdc++.h>
using namespace std;
long long DP[44];
void init()
{
DP[0] = 1;
DP[1] = 2;
for(int i=2;i<44;++i)
DP[i] = DP[i-1] + DP[i-2];
}
void solve(int n,int k)
{
if(n==0)
return;
if(n==1)
{
cout << (k-1);
return;
}
if(k>DP[n-1])
{
cout << "10";
solve(n-2,k-DP[n-1]);
}
else
{
cout << "0";
solve(n-1,k);
}
}
int main()
{
init();
int n,k;
cin >> n >> k;
if(k>DP[n])
cout << "-1";
else
solve(n,k);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgpsb25nIGxvbmcgRFBbNDRdOwoKdm9pZCBpbml0KCkKewoJRFBbMF0gPSAxOwoJRFBbMV0gPSAyOwoJZm9yKGludCBpPTI7aTw0NDsrK2kpCgkJRFBbaV0gPSBEUFtpLTFdICsgRFBbaS0yXTsJCn0KCnZvaWQgc29sdmUoaW50IG4saW50IGspCnsKCWlmKG49PTApCgkJcmV0dXJuOwoJaWYobj09MSkKCXsKCQljb3V0IDw8IChrLTEpOwoJCXJldHVybjsKCX0KCWlmKGs+RFBbbi0xXSkKCXsKCQljb3V0IDw8ICIxMCI7CgkJc29sdmUobi0yLGstRFBbbi0xXSk7Cgl9CgllbHNlCgl7CgkJY291dCA8PCAiMCI7CgkJc29sdmUobi0xLGspOwoJfQp9CgppbnQgbWFpbigpCnsKCWluaXQoKTsKCWludCBuLGs7CgljaW4gPj4gbiA+PiBrOwoJaWYoaz5EUFtuXSkKCQljb3V0IDw8ICItMSI7CgllbHNlCgkJc29sdmUobixrKTsKCXJldHVybiAwOwp9