1 //POJ 1067
 2 #include<cmath>
 3 #include<cstdio>
 4 #include<algorithm>
 5 int main(){
 6     freopen("1067.in","r",stdin);
 7     int a,b;
 8     double q=(1+sqrt(5.0))/2.0;
 9     while(scanf("%d%d",&a,&b)!=EOF){
10         if (a>b) std::swap(a,b);
11         int k=b-a;
12         printf("%d\n",a==(int)(k*q) ? 0 : 1);
13     }
14     return 0;
15 }