#include <bits/stdc++.h>
using namespace std;
void k_007() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b);
long long gcd(long long a, long long b);
long long prime(long long n);
long long power(long long x, long long y);
long long lcm(long long a, long long b);
int32_t main() {
  k_007();
  long long x;
  cin >> x;
  while (x--) {
    string s;
    cin >> s;
    long long zero = 0, even = 0, sum = 0;
    for (long long i = 0; i < s.size(); i++) {
      long long c = s[i] - '0';
      if (c == 0) zero++;
      if (c % 2 == 0) even++;
      sum += c;
    }
    if (zero > 0 && even > 1 && sum % 3 == 0)
      cout << "red" << endl;
    else
      cout << "cyan" << endl;
  }
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long prime(long long n) {
  long long flag = 1;
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) {
      flag = 0;
      break;
    }
  }
  return flag;
}
long long power(long long x, long long y) {
  if (y == 0)
    return 1;
  else if (y % 2 == 0)
    return ((power(x, y / 2) % 1000000007) * (power(x, y / 2) % 1000000007)) %
           1000000007;
  else
    return ((x % 1000000007) * (power(x, y / 2) % 1000000007) *
            (power(x, y / 2) % 1000000007)) %
           1000000007;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
