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

map<char,int> f;

void foo(){
	for(int i=0 ; i<16 ; ++i ){
		if( i < 10 )
			f[(char)(i+'0')] = i;
		else
			f[(char)(i-10+'a')] = i;
	}
}

int to_i(char c1,char c2){
	return f[c1]*16+f[c2];
}

vector<int> solve(string s){
	int R = to_i( s[1] , s[2] );
	int G = to_i( s[3] , s[4] );
	int B = to_i( s[5] , s[6] );
	vector<int> color;
	color.push_back( R );
	color.push_back( G );
	color.push_back( B );
	return color;
}

int main(){
	const int t[8][3] = {
		{ 0 , 0 , 0 },
		{ 0 , 0 ,255},
		{ 0 ,255, 0 },
		{ 0 ,255,255},
		{255, 0 , 0 },
		{255, 0 ,255},
		{255,255, 0 },
		{255,255,255}
	};
	const string colorName[8] = {"black","blue","lime","aqua","red","fuchsia","yellow","white"};
	foo();

	string s;
	while( cin >> s , s != "0" ){
		vector<int> color = solve( s );
		int Rk = color[0];
		int Gk = color[1];
		int Bk = color[2];
		int ans = 0;
		int dk = 255*3+1;
		//cout << "R:" << Rk << " G:" << Gk << " B:" << Bk << endl;
		
		for(int i=0 ; i<8 ; ++i ){
			int R = t[i][0];
			int G = t[i][1];
			int B = t[i][2];
			dk = min( abs(Rk-R)+abs(Gk-G)+abs(Bk-B) , dk );
		}

		for(int i=0 ; i<8 ; ++i ){
			int R = t[i][0];
			int G = t[i][1];
			int B = t[i][2];
			if( abs(Rk-R)+abs(Gk-G)+abs(Bk-B) == dk ){
				ans = i;
				break;
			}
		}
		cout << colorName[ ans ] << endl;
	}
}