Go Back
Swedish House Mafia ⚫️⚫️⚫️ (100)
Description

Problem Author: Omkar Prabhu
Lets celebrate 03 25 18!
You are given a very long number, find if it is divisible by 03 or not.

Input

The first line contains T the number of test cases.
Each test case contains a number N.

Output

For each test case, print single line containing greyhound or untilone if number is divisible by 03 or not respectively.

Constraints

1 < T < 100
1 < N < 10^100 (oh yeah)

Example
Copy Input

Input:
2
22
100002

Output:
untilone
greyhound

Explanation

Listen to them here:
Axwell: In My Mind
Sebastian Ingrosso: Reload
Steve Angello: Payback

Good Bye Batch 15-19
#OneLastTime Contest from Batch of 2015-19 of SIES GST



Announcement
Surprise Problem Added!
Contest is extended by 24 hours!

Problem Tags
adhoc, math

Supported by our Coding Partner