Robin Loves Game

Given a string T, determine if it contains a subsequence that can be rearranged to form the string \(robinlovesgame\). In other words, check whether each character in the target string appears in T at least as many times as it occurs in \(robinlovesgame\).

If the condition is met, output "Game on, Robin!"; otherwise, output "Try again, Robin!".

Note: The subsequence does not need to be contiguous. Only the frequency of characters matters.

inputFormat

The input is read from standard input (stdin) as a single line string T that consists of lowercase English letters.

outputFormat

The output should be printed to standard output (stdout) as a single line message: either "Game on, Robin!" or "Try again, Robin!".

xroazinboelovsgamxe

Game on, Robin!