#include <iostream>
#include <algorithm>
using namespace std;
int A[1000000];
int main() {
  int n;
  while(1) {
    cin >> n;
    if(n == 0) break;
    for(int i = 0; i < n; i++) {
      cin >> A[i];
    }
    sort(A, A+n);

    int cnt;
    int maxi = -1;
    int maxA;
    for(int i = 0; i < n; ) {
      int a = A[i];
      cnt = 1;
      for(i++; i < n && A[i] == a; i++) {
	cnt++;
      }
      if(cnt > maxi) {
	maxi = cnt;
	maxA = a;
      }
    }
    if(maxi > n/2) cout << maxA << endl;
    else          cout << "NO COLOR" << endl;
  }
  return 0;
}