#include<bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
long long fib[100];
 
void fillFib()
{
	ll a=-1,b=1;
	ll ind = 0;
	for(ll i=0;i<100;i++)
	{
		ll sum = a+b;
		a=b;
		b=sum;
		fib[ind++] = sum;
	}
}
 
bool isFib(ll n)
{
	for(ll i=0;i<100;i++)
	{
		if(fib[i] == n)
		{
			return true;
		}
	}
	return false;
}
 
bool isPrime(ll n)
{
	if(n==1 || n==0)
		return false;
	for(ll i=2;i*i<=n;i++)
	{
		if(n%i == 0)
			return false;
	}
	return true;
}
 
int main()
{
	ll t;
	cin>>t;
	fillFib();
	while(t--)
	{
		ll n;
		cin>>n;
		if(isFib(n) && isPrime(n))
		{
			cout<<"Green"<<endl;
		}
		else
		{
			cout<<"Red"<<endl;
		}
	}
	return 0;
}
 

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnR5cGVkZWYgbG9uZyBsb25nIGxsOwoKbG9uZyBsb25nIGZpYlsxMDBdOwoKdm9pZCBmaWxsRmliKCkKewoJbGwgYT0tMSxiPTE7CglsbCBpbmQgPSAwOwoJZm9yKGxsIGk9MDtpPDEwMDtpKyspCgl7CgkJbGwgc3VtID0gYStiOwoJCWE9YjsKCQliPXN1bTsKCQlmaWJbaW5kKytdID0gc3VtOwoJfQp9Cgpib29sIGlzRmliKGxsIG4pCnsKCWZvcihsbCBpPTA7aTwxMDA7aSsrKQoJewoJCWlmKGZpYltpXSA9PSBuKQoJCXsKCQkJcmV0dXJuIHRydWU7CgkJfQoJfQoJcmV0dXJuIGZhbHNlOwp9Cgpib29sIGlzUHJpbWUobGwgbikKewoJaWYobj09MSB8fCBuPT0wKQoJCXJldHVybiBmYWxzZTsKCWZvcihsbCBpPTI7aSppPD1uO2krKykKCXsKCQlpZihuJWkgPT0gMCkKCQkJcmV0dXJuIGZhbHNlOwoJfQoJcmV0dXJuIHRydWU7Cn0KCSAKaW50IG1haW4oKQp7CglsbCB0OwoJY2luPj50OwoJZmlsbEZpYigpOwoJd2hpbGUodC0tKQoJewoJCWxsIG47CgkJY2luPj5uOwoJCWlmKGlzRmliKG4pICYmIGlzUHJpbWUobikpCgkJewoJCQljb3V0PDwiR3JlZW4iPDxlbmRsOwoJCX0KCQllbHNlCgkJewoJCQljb3V0PDwiUmVkIjw8ZW5kbDsKCQl9Cgl9CglyZXR1cm4gMDsKfQo=

NwoxCjMKMTkKMTIKMTMKNQoyMQ==

7
1
3
19
12
13
5
21