1. 
/**
* FWP: Ausgewaehlte Probleme aus dem ACM (SS10)
*
* Method: Math: GCD
* Problem: 408 - UniformGenerator
* Accepted: 0.300
* @author Evgeni Pavlidis
*
*/
import java.io.*;
import java.util.*;

class Main {

private static Set<Integer> cycle = new HashSet<Integer>();
private static final int ROUNDS = 1;

private static int ggT(int a, int b)
{
return (b == 0)? a : ggT(b, a % b);
}

public static void main(String...args)
{
Scanner scanner = new Scanner(System.in);

int step, mod, counter;
String output = "";

while( scanner.hasNextInt() )
{
step = scanner.nextInt();
mod = scanner.nextInt();

System.out.printf("%10d%10d %s Choice\n\n", step, mod, ggT(step,mod) == 1? "Good" : "Bad");
}
}
}