#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<regex>
#include<vector>
using namespace std;

//#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

//n??????
//Radix r("0123456789abcdef");
//http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0208
class Radix {
private:
	const char* s;
	int a[128];
public:
	Radix(const char* s = "0123456789ABCDEF") : s(s) {
		for (int i = 0; s[i]; i++) a[(int)s[i]] = i;
	}
	//10?????´??° ??? n???????????????
	string format(long long x, int n) {
		if (!x) return "0";
		char t[64] = {};
		int i;
		for (i = 62; x; i--) {
			t[i] = s[x % n];
			x /= n;
		}
		return string(t + i + 1);
	}
	//m??????????????? ??? n???????????????
	string format(const string &t, int m, int n) {
		return format(format(t, m), n);
	}
	//m??????????????? ??? 10?????´??°
	long long format(const string &t, int m) {
		long long sm = a[(int)t[0]];
		for (int i = 1; i < (int)t.length(); i++)
			sm = sm * m + a[(int)t[i]];
		return sm;
	}
};


signed main() {
	string color[] = { "black","blue","lime","aqua","red","fuchsia","yellow","white" };
	int R[] = { 0,0,0,0,0xff,0xff,0xff,0xff };
	int G[] = { 0,0,0xff,0xff,0,0,0xff,0xff };
	int B[] = { 0,0xff,0,0xff,0,0xff,0,0xff };
	Radix r("0123456789abcdef");
	for (string s; cin >> s&&s != "0";) {
		int RR, GG, BB;
		RR = r.format(s.substr(1, 2), 16);
		GG = r.format(s.substr(3, 2), 16);
		BB = r.format(s.substr(5, 2), 16);
		int min = INF, ans;
		rep(i, 0, 8) {
			int d = (RR - R[i])*(RR - R[i]) + (GG - G[i])*(GG - G[i]) + (BB - B[i])*(BB - B[i]);
			if (min > d) {
				min = d;
				ans = i;
			}
		}
		cout << color[ans] << endl;
	}
	return 0;
}