#include <bits/stdc++.h>
using namespace std;
const int MOD = int(1e9) + 7, MX = int(1e6) + 2;
template <typename T>
inline T mod(T a, T b) {
  return (a % b + b) % b;
}
void solve() {
  int n, a = 0, b = 0;
  scanf("%d", &n);
  while (n--) {
    int c, d;
    scanf("%d %d", &c, &d);
    if (c > d)
      a++;
    else if (c < d)
      b++;
  }
  if (a > b)
    puts("Mishka");
  else if (a < b)
    puts("Chris");
  else
    puts("Friendship is magic!^^");
}
int main() { solve(); }
