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 C (GCC 5.4.1) (judge verdict: Wrong Answer)

//#include "pch.h"
#include "stdio.h"
#include "stdlib.h"

int main()
{
	int N;
	int *A, *B;
	scanf("%d", &N);
	A = (int *)malloc(sizeof(int) * 200000);
	B = (int *)malloc(sizeof(int) * 200000);
	for (int i = 0; i < N; i++)
	{
		scanf("%d %d", &A[i], &B[i]);
	}

	// sort
	for (int i = 0; i < N - 1; i++)
	{
		for (int j = i + 1; j < N; j++)
		{
			// swap
			int temp;
			if (B[i] > B[j])
			{
				temp = A[i];
				A[i] = A[j];
				A[j] = temp;
				temp = B[i];
				B[i] = B[j];
				B[j] = temp;
			}
		}
	}

	// judge
	int left = B[0] - A[0];
	if (left < 0)
	{
		printf("No");
		free(A);
		free(B);
		return 0;
	}
	for (int i = 1; i < N; i++)
	{
		left += B[i] - B[i - 1];
		if (left < A[i])
		{
			printf("No");
			free(A);
			free(B);
			return 0;
		}
		left -= A[i];
	}

	printf("Yes");
	free(A);
	free(B);

	return 0;
}