Programmers like to play with lucky numbers. Lucky numbers are positive integers whose decimal representations only contain the digits 2, 3, 5 and 7. For example, 235, 753, 2223 and 53227 are lucky numbers and 221, 47474 and 754223 are not.

A lucky number is called "cool" if it contains at least 2 twos in a row (like "35225"), at least 3 threes in a row (like "353333"), at least 5 fives in a row (like "55555237"), at least 7 sevens in a row (like "777777777"), or any combination of the above (like "333522227").

Your job is to write a program that will read a string S that consists of the digits 2, 3, 5 and 7 and question marks (?) and will output whether or not the question marks in S may be replaced with the digits 2, 3, 5 and 7 in order to get a cool number (each question mark can be replaced with only one digit).

Input

The first line of input contains the length L (1 ≤ L ≤ 250) of the string S. The second line contains the string S.

In test cases worth at least 30% of the full score, the string S will not contain any question marks ('?').

Output

Your program should output "cool" if the input string can become a cool number, or "boring" otherwise (quotes for clarity).

Constraints

Time limit: 1 second
Memory limit: 64 megabytes

Examples

input
8
233?5757

output
cool

input
10
57?5?757?3

output
boring

Feedback: During the contest, your submissions for this task will be evaluated on 50% of the official test cases. After the evaluation of a submission is done, you will be shown a summary of the results.