#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define MOD 1000000007
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;
typedef pair<int, string> PSI;

string s;

string colortable[] = { "black", "blue", "lime", "aqua",
"red", "fuchsia", "yellow", "white" };
double numtable[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 }
};

double changenum(string s){
	double res = 0;
	REP(i, 2){
		double num;
		if (s[i] >= '0'&&s[i] <= '9') num = s[i] - '0';
		else if (s[i] == 'a')num = 10;
		else if (s[i] == 'b')num = 11;
		else if (s[i] == 'c')num = 12;
		else if (s[i] == 'd')num = 13;
		else if (s[i] == 'e')num = 14;
		else if (s[i] == 'f')num = 15;
		
		if (i == 0)res += num * 16;
		else res += num;
	}
	return res;
}

void solve(){

}

int main(){
	while (cin >> s&&s != "0"){
		int ans;
		double dk = INF, rk = changenum(s.substr(1, 2)),
			gk = changenum(s.substr(3, 2)), bk = changenum(s.substr(5, 2));
		REP(i, 8){
			double num = sqrt(pow(numtable[i][0] - rk, 2)
				+ pow(numtable[i][1] - gk, 2)
				+ pow(numtable[i][2] - bk, 2));
			if (num - dk < EPS){
				dk = num;
				ans = i;
			}
		}
		cout << colortable[ans] << endl;
	}
}