CSES - KILO 2016 4/5 - k-mer
  • Time limit: 1.00 s
  • Memory limit: 512 MB

The study of k-mers is important in bioinformatics. A k-mer is a substring of DNA that has length k. Uolevi is investigating a crime scene and he has found a fragment of DNA. He knows that Maija's DNA contains a lot of 4-mers GCGC while Kaaleppi's DNA contains a lot of 4-mers ATAT. Given the DNA Uolevi found, find out if it is more likely to be Maija's or Kaaleppi's. In particular, find which 4-mer is more frequent in the DNA, GCGC or ATAT.

Input

The only line of input contains string S, the DNA fragment. S consists of characters A, T, C and G.

Output

If GCGC is more frequent, then output Maija, and if ATAT is more frequent, then output Kaaleppi. If they are both equally frequent, then output not sure.

Constraints

  • 1 \le |S| \le 10^4

Examples

Input:

ATAGCGCATAGG

Output:

Maija

Input:

GCGCATATAT

Output:

Kaaleppi

Input:

AGCGTGAATTG

Output:

not sure