#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <iomanip>
using namespace std;

const int INF = 1e9;
typedef long long ll;

struct Color{
  string name;
  int R, G, B;
};

Color list[8];

void init(){
  list[0].name = "black";   list[0].R = 0x00; list[0].G = 0x00; list[0].B = 0x00;
  list[1].name = "blue";    list[1].R = 0x00; list[1].G = 0x00; list[1].B = 0xff;
  list[2].name = "lime";    list[2].R = 0x00; list[2].G = 0xff; list[2].B = 0x00;
  list[3].name = "aqua";    list[3].R = 0x00; list[3].G = 0xff; list[3].B = 0xff;
  list[4].name = "red";     list[4].R = 0xff; list[4].G = 0x00; list[4].B = 0x00;
  list[5].name = "fuchsia"; list[5].R = 0xff; list[5].G = 0x00; list[5].B = 0xff;
  list[6].name = "yellow";  list[6].R = 0xff; list[6].G = 0xff; list[6].B = 0x00;
  list[7].name = "white";   list[7].R = 0xff; list[7].G = 0xff; list[7].B = 0xff;
}

int main(void){
  init();
  string colorcode;
  while(cin >> colorcode && colorcode != "0"){
    int r = stoi(string(colorcode, 1, 2), nullptr, 16);
    int g = stoi(string(colorcode, 3, 2), nullptr, 16);
    int b = stoi(string(colorcode, 5, 2), nullptr, 16);
    int n, mind = INF;
    for(int i = 0; i < 8; i++){
      int d = (r - list[i].R) * (r - list[i].R) + (g - list[i].G) * (g - list[i].G) + (b - list[i].B) * (b - list[i].B);
      if(d < mind){
        mind = d;
        n = i;
      }
    }
    cout << list[n].name << endl;
  }
  return 0;
}