#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
//	cut here before submit 
//	freopen ("testcase.WCITU", "r", stdin );
	int n;
	while (scanf ("%d", &n ), n ){
		map<int,int, greater<int> > color; color.clear();
		rep (i, n ){
			int in;
			scanf ("%d", &in );
			color[in]++;
		} // end rep
		int res = 0;
		bool found = false;		
		map<int,int,greater<int> >::iterator it = color.begin();
		for (; it != color.end(); it++ ){
			if ((*it).second > n/2 ){
				res = (*it).first;
				found = true;
				break;
			} // end if
		} // end for
		
		if (found ){
			printf ("%d\n", res );
		}else{
			printf ("NO COLOR\n" );
		} // end if
	} // end while

	return 0;
}