Given a phrase, score each side by how often its letters appear in KANGAROO or KIWIBIRD, then report the higher score or a tie.
Easy2ImplementationStringHash mapSimulationInterviewNo attempts yetTime limit2sMemory limit512 MBThe national animals of Australia and New Zealand, the kangaroos and the kiwis, have been feuding for a long time. Centuries ago the kangaroos and the kiwis were great friends and played happily together all day and all night. Over time both grew too tired to play 24 hours a day, so they had to decide when to play: the day time, which the kangaroos prefer, or the night time, which the kiwis prefer. That disagreement started the feud, and it has lasted ever since.
The king of the kangaroos and the queen of the kiwis are now at a secret meeting under the Tasman Sea, hoping to stop the feud. After hours of negotiation they decided that the only fair way to settle it is to let a neutral third party pick the winner. That third party is you.
You decide the winner with the following algorithm.
For example, if the secret phrase is Australia, the kangaroos score 7 and the kiwis score 4. In that case the kangaroos win the feud.

Given the secret phrase, determine who wins the feud.
The input is one line holding the secret phrase. The secret phrase is non-empty, contains only uppercase and lowercase letters, and is at most 100 characters long.
If there is a winner, print the winner's name. Print Kangaroos if the kangaroos win and Kiwis if the kiwis win. If the two scores are equal, print Feud continues instead.