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