#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1; i>=0; i--)
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define pr(a) cout << (a) << endl
#define PR(a,b) cout << (a) << " " << (b) << endl
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000001;
const ll MAXL=1000000000000000001LL;
const ll mod=1000000007;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

double x(string s) {
  double a=1,ans=0;
  rrep(i,2) {
    if(isdigit(s[i])) ans+=(int)(s[i]-'0')*a;
    else ans+=((int)(s[i]-'a')+10)*a;
    a*=16;
  }
  return ans;
}

int main() {
  double d[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}};
  string c[8]={"black","blue","lime","aqua","red","fuchsia","yellow","white"};
  string s;
  while(cin >> s && s!="0") {
    int ans=0;
    double min=MAX;
    double z[3];
    s=s.substr(1);
    rep(i,3) z[i]=x(s.substr(i*2,2));
    rep(i,8) {
      double v=sqrt((z[0]-d[i][0])*(z[0]-d[i][0])+(z[1]-d[i][1])*(z[1]-d[i][1])+(z[2]-d[i][2])*(z[2]-d[i][2]));
      if(v<min) {
	ans=i;
	min=v;
      }
    }
    pr(c[ans]);
  }
  return 0;
}
