/*
TASK MOB
LANG C++
*/
#include<iostream.h>
using namespace std;
int main () {
	int a;
	int b;
	int m;
	int max=0;;
	int brojed=0;
	int brojpr=0;
	bool prost=true;
	int promno[1000];
	cin>>a;
	cin>>b;
	m=0;
	int n;
	int kurnet;
	for(int i=0;i<=999;i=i+1){
		promno[i]=0;}
		
		
	for(n=a;n<=b;n=n+1){if(n==1){cout<<n;}else{
		brojpr=0;max=0;
		for(int p=2;p<=n;p=p+1){
			kurnet=n;prost=true;
			if(max<brojed){max=brojed;}brojed=0;
			for(int ko=2;ko<p;ko=ko+1){
				if(p%ko==0){prost=false;}}
			while(kurnet%p==0&&prost==true){kurnet=kurnet/p;brojed=brojed+1;}
			brojpr=brojpr+brojed;
			}
			
		}
			if(max>1){cout<<"0"<<"\n";}else{if(brojpr%2==0){cout<<"1"<<"\n";}else{cout<<"-1\n";}}
		}
		
		
	
	
	return 0;
}
