/*
TASK:MOB
LANG:C++
*/
#include<iostream>
using namespace std;
int c[10000];
int n(int a)
{
    int k,j,br=0,d=2,i=0,l=0;
    while(a!=1)
    {
    if(a%d==0){a/=d;br++;c[i++]=d;}
    else
    d++;
    }
    for(j=0;j<i;j++)
    {
    for(k=j+1;k<i;k++)
    if(c[k]==c[j]){l=1;break;}
    if(l==1)break;
    }
    for(j=0;j<i;j++)
    c[j]=0;
    if(l==1)return 0;
    if(br%2==0)return 1;
    if(br%2-1||br==1)return -1;
}
int main()
{
    int a,b,i;
    cin>>a>>b;
    for(i=a;i<=b;i++)
    cout<<n(i)<<endl;
    return 0;
}
