Problem:
What Color Is The Universe?

On a clear night, a boy, Campanella looked up at the sky, there were many stars which have different colors such as red, yellow, green, blue, purple, etc. He was watching the stars and just lost track of time. Presently, he wondered,

"There are many stars in the space. What color is the universe if I look up it from outside?"

Until he found the answer to this question, he couldn't sleep. After a moment's thought, he proposed a hypothesis,

"When I observe the stars in the sky, if more than half of the stars have the same color, that is the color of the universe."

He has collected data of stars in the universe after consistently observing them. However, when he try to count the number of star, he was in bed sick with a cold. You decided to help him by developing a program to identify the color of the universe.

You are given an array A. Let |A| be the number of element in A, and let Nm be the number of m in A. For example, if A = {3, 1, 2, 3, 3, 1, 5, 3}, |A| = 8, N3 = 4, N1 = 2, N5 = 1. Your program have to find m such that:

Nm > (|A| / 2 )

If there is no such m, you also have to report the fact. There is no
such m for the above example, but for a array A = {5, 2, 5, 3, 4, 5, 5}, 5 is the answer.

Input

There are several test cases. For each test case, in the first line |A| is given. In the next line, there will be |A| integers. The integers are less than 231 and |A| < 1,000,000. The input terminate with a line which contains single 0.

Output

For each test case, output m in a line. If there is no answer, output "NO COLOR" in a line.

Sample Input

8
3 1 2 3 3 1 5 3
7
5 2 5 3 4 5 5
0

Output for the Sample Input

NO COLOR
5

Solution in C (judge verdict: Accepted)

// AOJ 1008: What Color Is The Universe?
// 2017.8.19 bal4u@uu
// 2017.11.9 retry

#include <stdio.h>
#include <string.h>

#define HASHSIZ 120011
typedef struct { int n, c; } HASH;
HASH hash[HASHSIZ+2], *hashend = hash+HASHSIZ;

int color, cnt;

int lookup(int n)
{
	HASH *p = hash + n % HASHSIZ;
	while (p->n) {
		if (p->n == n) return ++(p->c);
		if (++p == hashend) p = hash;
	}
	p->n = n, p->c = 1;
	return 1;
}

char buf[11000000], *p;
int getint()
{
	int n = 0;
	while (*p >= '0') n = (n<<3) + (n<<1) + (*p++ & 0xf);
	return n;
}

int main()
{
	int n, n2, i, k;

	while (fgets(p=buf, 20, stdin) && *p != '0') {
		n = getint(), n2 = n >> 1;
		memset(hash, 0, sizeof(hash));
		fgets(p=buf, sizeof(buf), stdin);
		for (cnt = 1, i = n; i--; ) {
			k = getint(), p++;
			if (lookup(k) == cnt) cnt++, color = k;
		}
		if (--cnt > n2) printf("%d\n", color);
		else puts("NO COLOR");
	}
	return 0;
}