#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
using namespace std;

string table[] = {"black","blue","lime","aqua","red","fuchsia","yellow","white"};

int to(char c){
	if( c >= 'a' ) return 10 + c - 'a';
	return c - '0';
}

int main(){
	string s;
	while(cin >> s && s != "0"){
		int r = to(s[1])*16+to(s[2]);
		int g = to(s[3])*16+to(s[4]);
		int b = to(s[5])*16+to(s[6]);
		vector< pair<int,int> > answer;
		for(int i = 0 ; i < 8 ; i++){
			int R = (i>>2&1)*255;
			int G = (i>>1&1)*255;
			int B = (i&1)*255;
			int dist = (R-r)*(R-r) + (g-G)*(g-G) + (b-B)*(b-B);
			//cout << R <<" " << G << " " << B << " " <<  endl;
			answer.push_back( make_pair(dist,i) );
		}
		cout << table[(*min_element(answer.begin(),answer.end())).second] << endl;
	}
}