#include <iostream>
#include <limits.h>
#include <queue>
#include <algorithm>
#include <string>
#include <map>

using namespace std;

typedef pair<int,int> P;
typedef map<int,int> MP;

const int INF=INT_MAX/3;
//const int V_MAX=10000,E_MAX=10000;
//int V,E;
const int N=1000000;
int A[N];

void solve(int n){

  //fill(num,num+n,0);
  MP num;
 
  for(int i=0;i<n;i++){ 
    if(num[A[i]]==0) num[A[i]]=1;
    else num[A[i]]++;
  }
  
  for(MP::iterator itr=num.begin();itr!=num.end();itr++)
    if(itr->second>(n/2)){
      cout<<itr->first<<endl;
      return;
    }
  
  cout<<"NO COLOR\n";
}
  



int main(){

  int n=0;
  cin>>n;
  while(n!=0){
    for(int i=0;i<n;i++)
      cin>>A[i];
    solve(n);
    cin>>n;
  }

  return 0;
}