Codeforces Round #365 (Div. 2) A

Description

Mishka is a little polar bear. As known, little bears loves spending their free time playing dice for chocolates. Once in a wonderful sunny morning, walking around blocks of ice, Mishka met her friend Chris, and they started playing the game.

Rules of the game are very simple: at first number of rounds n is defined. In every round each of the players throws a cubical dice with distinct numbers from 1 to 6 written on its faces. Player, whose value after throwing the dice is greater, wins the round. In case if player dice values are equal, no one of them is a winner.

In average, player, who won most of the rounds, is the winner of the game. In case if two players won the same number of rounds, the result of the game is draw.

Mishka is still very little and can't count wins and losses, so she asked you to watch their game and determine its result. Please help her!

Input

The first line of the input contains single integer n n (1 ≤ n ≤ 100) — the number of game rounds.

The next n lines contains rounds description. i-th of them contains pair of integers mi and ci (1 ≤ mi,  ci ≤ 6) — values on dice upper face after Mishka's and Chris' throws in i-th round respectively.

Output

If Mishka is the winner of the game, print "Mishka" (without quotes) in the only line.

If Chris is the winner of the game, print "Chris" (without quotes) in the only line.

If the result of the game is draw, print "Friendship is magic!^^" (without quotes) in the only line.

Examples

input

3
3 5
2 1
4 2

output

Mishka

input

2
6 1
1 6

output

Friendship is magic!^^

input

3
1 5
3 3
2 2

output

Chris

Note

In the first sample case Mishka loses the first round, but wins second and third rounds and thus she is the winner of the game.

In the second sample case Mishka wins the first round, Chris wins the second round, and the game ends with draw with score 1:1.

In the third sample case Chris wins the first round, but there is no winner of the next two rounds. The winner of the game is Chris.

题意：两个人抛色子，谁赢的次数多？

解法：模拟

#include <bits/stdc++.h>
using namespace std;
#define inf (1<<31)-1
int a,b;
int n,m;
int sum1,sum2,sum3;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a>>b;
        if(a>b)
        {
            sum1++;
        }
        else if(a==b)
        {
            sum2++;
        }
        else
        {
            sum3++;
        }
    }
    if(n%2==0)
    {
        if(sum1>sum3)
        {
            cout<<"Mishka"<<endl;
        }
        else if(sum1==sum3)
        {
            cout<<"Friendship is magic!^^"<<endl;
        }
        else
        {
            cout<<"Chris"<<endl;
        }
    }
    else
    {
        if(sum1>sum3)
        {
            cout<<"Mishka"<<endl;
        }
        else if(sum1==sum3)
        {
            cout<<"Friendship is magic!^^"<<endl;
        }
        else
        {
            cout<<"Chris"<<endl;
        }
    }
    return 0;
}