#include <bits/stdc++.h>
const double PI = acos(-1.0);
using namespace std;
int setb(int n, int pos) { return n = n | (1 << pos); }
int resb(int n, int pos) { return n = n & ~(1 << pos); }
bool checkb(int n, int pos) { return (bool)(n & (1 << pos)); }
inline long long bigmod(long long b, long long p, long long m) {
  long long ret = 1, cur = b % m;
  while (p) {
    if (p & 1) ret = (ret * cur) % m;
    cur = (cur * cur) % m;
    p = p >> 1;
  }
  return ret;
}
char str[1000005];
void solve() {
  int z = 0;
  for (int i = 0; str[i] != 0; i++)
    if (str[i] == '0') z = 1;
  if (z == 0) {
    puts("cyan");
    return;
  }
  z = 0;
  int tot = 0;
  int even = 0;
  for (int i = 0; str[i] != 0; i++) {
    if (str[i] == '0' && z == 0) {
      z = 1;
      continue;
    }
    int x = str[i] - '0';
    if (x % 2 == 0) even = 1;
    tot += x;
  }
  if (even && (tot % 3 == 0))
    puts("red");
  else
    puts("cyan");
}
int main() {
  long long t, T;
  scanf("%lld", &T);
  for (t = 1; t <= T; t++) {
    scanf("%s", str);
    solve();
  }
  return 0;
}
