该楼层疑似违规已被系统折叠 隐藏此楼查看此楼
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 nn of them how much effort they needed to reach red.
"Oh, I just spent xixi hours solving problems", said the ii-th of them.
Bob wants to train his math skills, so for each answer he wrote down the number of minutes (60⋅xi60⋅xi), thanked the grandmasters and went home. Bob could write numbers with leading zeroes — for example, if some grandmaster answered that he had spent 22 hours, Bob could write 000120000120 instead of 120120.
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 nn numbers, denoted y1y1, ..., ynyn.
For each of the numbers, help Bob determine whether yiyi can be a permutation of a number divisible by 6060 (possibly with leading zeroes).
Input
The first line contains a single integer nn (1≤n≤4181≤n≤418) — the number of grandmasters Bob asked.
Then nn lines follow, the ii-th of which contains a single integer yiyi — the number that Alice wrote down.
Each of these numbers has between 22 and 100100 digits '0' through '9'. They can contain leading zeroes.
Output
Output nn lines.
For each ii, output the following. If it is possible to rearrange the digits of yiyi such that the resulting number is divisible by 6060, output "red" (quotes for clarity). Otherwise, output "cyan".
Example
input
6
603
006
205
228
1053
0000000000000000000000000000000000000000000000
output
red
red
cyan
cyan
cyan
red
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
