#include <bits/stdc++.h>
long long zero = 0;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
long long expo(long long x, long long y) {
  long long res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (1ll * res * x) % 1000000007;
    y = y >> 1;
    x = (1ll * x * x) % 1000000007;
  }
  return res;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= n - i;
    res /= i + 1;
  }
  return res;
}
bool prime(long long n) {
  long long i;
  if (n == 1) return false;
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
using namespace std;
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, x, y, m = 0, c = 0;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> x >> y;
    if (x > y)
      m++;
    else if (y > x)
      c++;
  }
  if (m > c)
    cout << "Mishka";
  else if (m < c)
    cout << "Chris";
  else
    cout << "Friendship is magic!^^";
  return 0;
}
