Left Beehind

Time limit1sMemory limit1024 MB

Summary

Given the sweet and sour jar counts for each case, print whether Bill is left beehind, undecided, going to the convention, or never spoken to again at 13 jars.

Level: Easy1 of 10
Topics: Implementation
Solved: No attempts yet

Problem

Beekeeper Bill is ready to go to the annual beekeeper's convention with his friends. Bill packed his honey in jars, but unfortunately the honey in some of the jars has turned sour. Bill's friends are mean, and if too much of Bill's honey is sour they will go to the convention without him.

If Bill has more jars of sour honey than sweet, he will be left "beehind". If Bill has more jars of sweet honey than sour, he will go to the convention. If Bill has the same number of sweet and sour jars, his friends are undecided. Lastly, Bill's friends are superstitious. If he has exactly 13 jars, they will never speak to him again. Bill needs new friends.

Input

Input consists of multiple cases, each on its own line. Each case consists of two numbers $x$ and $y$ ( $0 \le x, y \le 1000$ ), which are the number of sweet and sour jars Bill has, respectively. Input is terminated by a line containing two zeros.

Output

For each case, output one of the following results on its own line (without quotes).

"Left beehind." (note the spelling, those punsters)
"Undecided."
"To the convention."
"Never speak again."

If Bill's friends will never speak to him again, that is most important and should be the only output.

Examples1

Example 1

Input

Expected output

To the convention.
Left beehind.
Never speak again.
Undecided.