#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int,int> pint;

#define DE 1
#define FI first
#define SE second
#define PB push_back
#define MP make_pair
#define ALL(s) (s).begin(),(s).end()
#define REP(i,n) for (int i = 0; i < (int)(n); ++i)
#define EACH(i,s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl

template<class T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<", "<<P.second<<'>';}
template<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<"{ ";for(int i=0;i<P.size();++i){if(i>0)s<<", ";s<<P[i];}return s<<" }"<<endl;}
template<class T1, class T2> ostream& operator<<(ostream &s, map<T1,T2> P) {s<<"{ ";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<", ";s<<'<'<<it->first<<"->"<<it->second<<'>';}return s<<" }"<<endl;}



string ans[4] = {"Red", "Green", "Blue", "White"};

const double INF = 1LL<<30;
const double EPS = 1e-8;
const double PI = acos(-1.0);
double torad(int deg) {return (double)(deg) * PI / 180;}
double todeg(double ang) {return ang * 180 / PI;}

struct Point {
    double x, y;
    Point(double x = 0.0, double y = 0.0) : x(x), y(y) {}
    friend ostream& operator << (ostream &s, const Point &p) {return s << '(' << p.x << ", " << p.y << ')';}
};

Point operator + (Point p, Point q) {return Point(p.x + q.x, p.y + q.y);}
Point operator - (Point p, Point q) {return Point(p.x - q.x, p.y - q.y);}
Point operator * (Point p, double a) {return Point(p.x * a, p.y * a);}
Point operator * (double a, Point p) {return Point(a * p.x, a * p.y);}
Point operator * (Point p, Point q) {return Point(p.x * q.x - p.y * q.y, p.x * q.y + p.y * q.x);}
Point operator / (Point p, double a) {return Point(p.x / a, p.y / a);}
Point conj(Point p) {return Point(p.x, -p.y);}
Point rot(Point p, double ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}
Point rot90(Point p) {return Point(-p.y, p.x);}
double cross(Point p, Point q) {return p.x * q.y - p.y * q.x;}
double dot(Point p, Point q) {return p.x * q.x + p.y * q.y;}
double norm(Point p) {return dot(p, p);}
double abs(Point p) {return sqrt(dot(p, p));}
bool eq(Point p, Point q) {return abs(p - q) < EPS;}
double amp(Point p) {double res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}
bool operator < (Point p, Point q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}
bool operator > (Point p, Point q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}
Point operator / (Point p, Point q) {return p * conj(q) / norm(q);}

int ccw(Point a, Point b, Point c) {
    if (cross(b-a, c-a) > EPS) return 1;
    if (cross(b-a, c-a) < -EPS) return -1;
    if (dot(b-a, c-a) < 0) return 2;
    if (norm(b-a) < norm(c-a)) return -2;
    return 0;
}


struct Line : vector<Point> {
    Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {
        this->push_back(a);
        this->push_back(b);
    }
};


struct Circle : Point{
    double r;
    Circle(Point p = Point(0.0, 0.0), double r = 0.0) : Point(p), r(r) {}
};


typedef vector<Point> Polygon;
Point next(const Polygon &a, int x) {return a[(x+1)%a.size()];}
Point prev(const Polygon &a, int x) {return a[(x-1+a.size())%a.size()];}


Point proj(Point p, Line l) {
    double t = dot(p - l[0], l[1] - l[0]) / norm(l[1] - l[0]);
    return l[0] + (l[1] - l[0]) * t;
}

vector<Point> crosspoint(Line l, Line m) {
    vector<Point> res;
    double d = cross(m[1] - m[0], l[1] - l[0]);
    if (abs(d) < EPS) return vector<Point>();
    res.PB(l[0] + (l[1] - l[0]) * cross(m[1] - m[0], m[1] - l[0]) / d);
    return res;
}

vector<Point> crosspoint(Circle e, Line l) {
    vector<Point> res;
    Point p = proj(e, l);
    double rcos = abs(e - p);
    if (rcos > e.r + EPS) return vector<Point>();
    double rsin = sqrt(e.r * e.r - rcos * rcos);
    Point dir = (l[1] - l[0]) / abs(l[1] - l[0]);
    Point p1 = p + dir * rsin;
    Point p2 = p - dir * rsin;
    res.push_back(p1);
    if (!eq(p1, p2)) res.push_back(p2);
    return res;
}


bool isinterPS(Point p, Line s) {
    return (ccw(s[0], s[1], p) == 0);
}

vector<Point> crosspoint(Line l, vector<Line> path) {
    vector<Point> res;
    for (int i = 0; i < path.size(); ++i) {
        vector<Point> temp = crosspoint(l, path[i]);
        for (int j = 0; j < temp.size(); ++j) {
            if (isinterPS(temp[j], path[i])) res.PB(temp[j]);
        }
    }
    return res;
}

vector<Point> crosspoint_CS(Circle e, Line s) {
    vector<Point> res, temp = crosspoint(e, s);
    for (int i = 0; i < temp.size(); ++i) {
        if (isinterPS(temp[i], s)) res.push_back(temp[i]);
    }
    return res;
}

vector<Point> crosspoint_CP(Circle e, vector<Line> path) {
    vector<Point> res;
    for (int i = 0; i < path.size(); ++i) {
        vector<Point> temp = crosspoint_CS(e, path[i]);
        for (int j = 0; j < temp.size(); ++j) res.push_back(temp[j]);
    }
    return res;
}


int N;
double A, B;
double px, py, x, y;

Polygon pol;
vector<Line> path;

int main() {
    //freopen( "/Users/macuser/Documents/Programming/Contest/input.in", "r", stdin );
    
    while (cin >> N >> A >> B) {
        int res = -1;
        pol.clear(); path.clear();
        for (int i = 0; i < N; ++i) {
            cin >> x >> y;
            if (i != 0) {
                Line line(Point(px,py), Point(x,y));
                path.PB(line);
            }
            px = x; py = y;
        }
        
        Point PA;
        Line LA(Point(A, 0.0), Point(A, INF));
        vector<Point> vPA = crosspoint(LA, path);
        PA = vPA[0];
        pol.PB(PA); pol.PB(Point(PA.x, PA.y+1)); pol.PB(Point(PA.x-1, PA.y+1)); pol.PB(Point(PA.x-1, PA.y));
        
        //COUT(path); COUT(PA); COUT(pol);
        
        int now = 0, prev = 3;
        while (true) {
            ++res;
            
            double ang = INF; int next = -1, tn = now;
            for (int i = 0; i < 3; ++i) {
                tn = (tn+1)%4;
        
                double r = 1.0;
                if (i == 1) r = sqrt(2);
                Circle c(pol[now], r);
                vector<Point> cro = crosspoint_CP(c, path);
                sort(ALL(cro));
                
                if (cro.size() == 0) continue;
                
                double tang = amp( (pol[tn]-pol[now]) / (cro[cro.size()-1]-pol[now]) );
                if (tang < ang) {
                    ang = tang;
                    next = tn;
                }
            }
            
            for (int i = 0; i < 4; ++i) {
                if (i == now) continue;
                pol[i] = pol[now] + rot(pol[i]-pol[now], -ang);
            }
            
            //cout << res << " : " << MP(now, next) << ", " << ang << " ; " << pol;
            
            if (pol[next].x > B + EPS) break;
            prev = now; now = next;
        }
    
        cout << ans[now] << endl;
    }
    
    return 0;
}


Measured memory_bytes: 1324