#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;



int main()
{
    int N;
    int c=0;
    while(cin>>N)
    {
        if(N==0) break;
        vector<int> v(N);
        for(int c=0;c<N;c++) cin>>v[c];
        sort(v.begin(),v.end());
        int act = -1;
        int compte = 0;
        for(int c=0;c<N;c++)
        {
            if(v[c]!=act)
            {
                act=v[c];
                compte=1;
            }
            else compte++;
            if(compte > N/2)
            {
                cout<<v[c]<<endl;
                goto end;
            }
        }
        cout<<"NO COLOR"<<endl;
        end:;
    }
    return 0;
}