C. Corrupted Odyssey
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Thomas wanted to propose a string problem inspired by a famous story, but was uncertain of what story to use. Tyler, being a mythology nerd, proposed Homer's epic The Odyssey. Thomas's response to this was, "The Odyssey! What a lame piece of fiction. Percy Jackson did it better! In fact, I would go as far as to say that random gibberish would make a better story!" To try proving Thomas wrong, Tyler attempted to pull up a passage from The Odyssey on his computer, but to his dismay, his file was corrupted!

Tyler was able to prove that the copy of The Odyssey was corrupted in the following way: All non-alphabetical characters were removed, all capital letters were replaced with their lowercase counterparts, and then a substitution cipher was applied to the text. More formally, a permutation of the 26 lowercase English letters was generated; then, every letter was replaced with its corresponding new letter. That is, all 'a's were replaced with the first letter in the permutation, all 'b's were replaced with the second letter of the permutation, and so on. All substitutions are applied simultaneously.

Thomas still claims that it is indistinguishable from gibberish, so to settle their disagreement, Tyler has given you two strings. The following methods were used to generate the two strings:

  1. All non-alphabetical characters in an English translation of Homer's The Odyssey are removed and all uppercase characters are replaced with the corresponding lowercase letters. Of all substrings of 1000 characters in the text, a substring is chosen uniformly randomly. A substitution cipher is then generated by choosing a permutation of the 26 lowercase letters uniformly randomly, and then it is applied to the chosen substring.
  2. A string of 1000 characters was randomly generated. That is, each character of the string was generated by picking one of the 26 lowercase English letters with equal chance.

You are guaranteed that both methods were used to generate one string, and Tyler has asked you to determine which method was used to generate each string.

Input

The first line of input will consist of a single integer $$$n$$$ ($$$n = 35$$$ or $$$n =1000$$$) — the number of characters in the string. In all cases other than the sample, $$$n$$$ will equal $$$1000$$$.

The second and third lines of input will consist of a single string of $$$n$$$ lowercase English letters, each of which were generated using one of the two methods described above.

Output

Output two lines, each denoting which of the two methods was used to format each string. If method 1 was used to generate the string, output "Corrupted Odyssey" (without quotes); otherwise, output "Random Gibberish" (without quotes). The output is case sensitive.

Example
Input
35
ibukjacwauujxwqmfxwwpaoklajjuwaokkm
yiewscmawvpsuekbuwbysrfvzpkwankdskr
Output
Corrupted Odyssey
Random Gibberish
Note

Before the substitution cipher was applied, the substring taken from The Odyssey was "ouldtakealltheirsheepandcattleanddr."