Good Messages

Boris works at a secret communication station for the government, where he trains new employees to encode messages. Messages here are encoded with a rotation (Caesar) cipher, which replaces each letter with the letter a set offset away in the alphabet. For example, with offset $2$, 'a' becomes 'c' and 'y' becomes 'a'. To encode a message, the cipher may be applied more than once. Each application counts as one step.

Boris teaches new employees by demonstrating each step individually. He does not like a message that has at least half as many vowels as consonants after an encoding step. He counts 'a', 'e', 'i', 'o', 'u', and 'y' as vowels. Each such step makes him more annoyed.

Your job is to encode a given message and determine whether Boris sees fewer annoying steps than non-annoying ones. Since Boris wants to be happy at his job, he gives any message that annoys him too much to a colleague.

The first line contains an integer $O$ ($1 \le O \le 25$), the offset of the rotation cipher. The second line contains the message, which consists only of lowercase English letters. Its length is between $1$ and $80$ characters. The third line contains an integer $N$ ($1 \le N \le 26$), the number of times the cipher is applied.

Print 'Boris' if the number of steps that do not annoy him is strictly greater than the number of steps that do. Otherwise, print 'Colleague'.