CF1266A.Competitive Programmer

Bob is a competitive programmer. He wants to become red, and for that he needs a strict training regime. He went to the annual meeting of grandmasters and asked $n$ of them how much effort they needed to reach red.

"Oh, I just spent $x_i$ hours solving problems", said the $i$-th of them.

Bob wants to train his math skills, so for each answer he wrote down the number of minutes ($60 \cdot x_i$), thanked the grandmasters and went home. Bob could write numbers with leading zeroes — for example, if some grandmaster answered that he had spent $2$ hours, Bob could write $000120$ instead of $120$.

Alice wanted to tease Bob and so she took the numbers Bob wrote down, and for each of them she did one of the following independently:

• rearranged its digits, or
• wrote a random number.

This way, Alice generated $n$ numbers, denoted $y_1$, ..., $y_n$.

For each of the numbers, help Bob determine whether $y_i$ can be a permutation of a number divisible by $60$ (possibly with leading zeroes).

Bob 是一名竞技编程选手。他想成为红名选手，为此需要严格训练。他参加了大师们的年度会议，并向其中 $n$ 位询问了他们成为红名所需付出的努力。

“哦，我只花了 $x_i$ 小时刷题。”第 $i$ 位大师回答道。

为了锻炼自己的数学能力，Bob 对每位大师的回答都记录下了对应的分钟数（即 $60 \cdot x_i$），向大师们道谢后便回家了。Bob 记录数字时可能添加前导零——例如，若某位大师回答花费了 $2$ 小时，Bob 可能写下 $000120$ 而非 $120$。

Alice 想捉弄 Bob，于是取走了 Bob 写下的这些数字，并对其中每一个独立地执行以下两种操作之一：

• 重排其各位数字，或
• 随意写下一个数字。

这样，Alice 生成了 $n$ 个数字，记为 $y_1$, ..., $y_n$。

对每个数字，请帮助 Bob 判断：$y_i$ 是否可能是某个能被 $60$ 整除的数（允许含前导零）的各位数字的一个排列。

The first line contains a single integer $n$ ($1 \leq n \leq 418$) — the number of grandmasters Bob asked.

Then $n$ lines follow, the $i$-th of which contains a single integer $y_i$ — the number that Alice wrote down.

Each of these numbers has between $2$ and $100$ digits '0' through '9'. They can contain leading zeroes.

第一行包含一个整数 $n$（$1 \leq n \leq 418$）—— 表示 Bob 询问的国际象棋特级大师人数。

接下来是 $n$ 行，其中第 $i$ 行包含一个整数 $y_i$ —— 即 Alice 写下的数字。

每个数字由 $2$ 至 $100$ 位十进制数字 '0'–'9' 组成，可能包含前导零。

Output $n$ lines.

For each $i$, output the following. If it is possible to rearrange the digits of $y_i$ such that the resulting number is divisible by $60$, output "red" (quotes for clarity). Otherwise, output "cyan".

输出 $n$ 行。

对于每个 $i$，执行以下操作：若能重新排列 $y_i$ 的各位数字，使得得到的新数能被 $60$ 整除，则输出 red（引号仅用于清晰起见）；否则输出 cyan。

In the first example, there is one rearrangement that yields a number divisible by $60$, and that is $360$.

In the second example, there are two solutions. One is $060$ and the second is $600$.

In the third example, there are $6$ possible rearrangments: $025$, $052$, $205$, $250$, $502$, $520$. None of these numbers is divisible by $60$.

In the fourth example, there are $3$ rearrangements: $228$, $282$, $822$.

In the fifth example, none of the $24$ rearrangements result in a number divisible by $60$.

In the sixth example, note that $000\dots0$ is a valid solution.

在第一个例子中，存在一种重排方式可得到能被 $60$ 整除的数，即 $360$。

在第二个例子中，存在两种解：其一是 $060$，其二是 $600$。

在第三个例子中，共有 $6$ 种可能的重排：$025$、$052$、$205$、$250$、$502$、$520$。这些数中没有一个能被 $60$ 整除。

在第四个例子中，共有 $3$ 种重排：$228$、$282$、$822$。

在第五个例子中，全部 $24$ 种重排均不能得到能被 $60$ 整除的数。

在第六个例子中，请注意 $000\dots0$ 是一个合法的解。