else { int tmp = b;
tmp = b;
  private static final int gcd(int a, int b)  {    // Euclid's algorithm, copied from libg++.    if (b > a)      {	int tmp = a; a = b; b = tmp;      }    for(;;)      {	if (b == 0)	  return a;	else if (b == 1)	  return b;	else	  {	    int tmp = b;	    b = a % b;	    a = tmp;	  }      }  }