Problem:
Score : 100 points

Problem Statement

The door of Snuke's laboratory is locked with a security code.

The security code is a 4-digit number. We say the security code is hard to enter when it contains two consecutive digits that are the same.

You are given the current security code S. If S is hard to enter, print Bad; otherwise, print Good.

Constraints

S is a 4-character string consisting of digits.

Input

Input is given from Standard Input in the following format:

S

Output

If S is hard to enter, print Bad; otherwise, print Good.

Sample Input 1

3776

Sample Output 1

Bad

The second and third digits are the same, so 3776 is hard to enter.

Sample Input 2

8080

Sample Output 2

Good

There are no two consecutive digits that are the same, so 8080 is not hard to enter.

Sample Input 3

1333

Sample Output 3

Bad

Sample Input 4

0024

Sample Output 4

Bad

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.Scanner;

public class Main {
	
	public static long gcd(long a, long b) { 
	    if (a == 0) 
	        return b;  
	    return gcd(b % a, a);  
	 } 
	      
    public static long lcm(long a, long b) { 
        return (a*b)/gcd(a, b); 
    } 
	      
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		long a = sc.nextLong(), b = sc.nextLong(), c = sc.nextLong(), d = sc.nextLong();
		
		long cSum = (b / c - (long)Math.ceil(a * 1.0 / c) + 1);
		long dSum = (b / d - (long)Math.ceil(a * 1.0 / d) + 1);
		long common = ((b / lcm(c, d)) - (long)Math.ceil(a * 1.0 / lcm(c, d)) + 1);
				
		System.out.println((b - a + 1) - (cSum + dSum - common));
	}
}