#include<iostream>
#include<list>
#include<cstdio>

using namespace std;

const int mod = 100009;

typedef list<pair<int, int> > map;

map hashmap[mod];

int main(){
  int n;
  while(scanf("%d", &n), n){
    int ans = -1;

    if(n == 1){
      int a; scanf("%d", &a);
      printf("%d\n", a);
      continue;
    }

    for(int i = 0; i < mod; i++){
      hashmap[i].clear();
    }

    for(int i = 0; i < n; i++){
      int a; scanf("%d", &a);

      map &ls = hashmap[a % mod];

      bool ok = false;

      for(map::iterator it = ls.begin(); it != ls.end(); ++it){
	if(it->first == a){
	  ok = true;
	  ++(it->second);

	  if(it->second > n / 2){
	    ans = it->first;
	  }
	  break;
	}
      }

      if(!ok) ls.push_back(make_pair(a, 1));
    }

    if(ans == -1)
      puts("NO COLOR");
    else
      printf("%d\n", ans);
  }
  return 0;
}