There're different kinds of Knuckles in this world. According to the research, there're 26 different kinds of Knuckles.
Let's denote different kind of Knuckles as 'a' ~ 'z'.
Knuckles is a magic creature.
If you have at least 2 same kind of Knuckles, you can transform these Knuckles into any kind of Knuckles with same number of them.
For example：
if you have n=3 Knuckles representing as "aab" you can transform 'a' Knuckles into 'b' Knuckles. In the end you will get "bbb" Knuckles.
Because you're a deadly Ethnic nationalism, you want all Knuckles to be the same.
You can do the transformation many times.
Find out whether you can do that.
NOTE: Case 6 limits the memory to 1 MB, so try not to declare a large array.
Input contains two lines.
First line contains only one integer n( 1 <= n <= 107 ), representing the number of Knuckles.
Second line contains one string, the length of n.
If you can make all Knuckles the same, output "I'm the god of Knuckles!"
Otherwise, output "Different makes perfect"
Remember to print \n at the end of output