/*
TASK: MOB
LANG: C++
*/
#include<iostream>
using namespace std;
int prosti[]={2,3,5,7,11,13};
int broika_prosti_mnojiteli(int n){
    int br=0,i=0;
    while(i<6){
         if(n%prosti[i]==0) {br++; n/=prosti[i];}
         else i++;
         }
    return br;
    }
bool br_pr_mn_2(int n){
    int br=0,i=0,k[]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},j=0;
    while(i<6){
         if(n%prosti[i]==0) {br++; n/=prosti[i]; k[j]=prosti[i]; j++;}
         else i++;
         } 
    for(int i=0;i<j;i++) for(int r=0;r<i;r++) if(k[r]==k[i]) return true;//povtarqt se
    return false; //ne se povtarqt
    }
int main(){
    int a,b;
    cin>>a>>b;
    for(int i=a;i<=b;i++){
            if(i==1){cout<<"1\n"; continue;}
            if(br_pr_mn_2(i)){cout<<"0\n"; continue;}
            if(broika_prosti_mnojiteli(i)%2==0) {cout<<"1\n"; continue;}
            cout<<"-1\n";
            }
    return 0;
}
