#include <bits/stdc++.h>
using namespace std;
const int sieve_size = 15000002;
bool sieve[sieve_size + 1];
vector<long long> prime;
void Sieve() {
  prime.push_back(2);
  for (int i = 3; i * i <= sieve_size; i += 2) {
    if (!sieve[i]) {
      long long p = i * 2;
      for (int j = i * i; j <= sieve_size; j += p) {
        sieve[j] = true;
      }
    }
  }
  for (int i = 3; i <= sieve_size; i += 2) {
    if (!sieve[i]) prime.push_back(i);
  }
}
int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
inline int GA(long long n, vector<long long>& vec) {
  for (int i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    vec.push_back(x);
  }
  return 0;
}
inline int GAEG(long long m, vector<long long> vec[]) {
  for (int i = 0; i < m; ++i) {
    long long x, y;
    cin >> x >> y;
    x--, y--;
    vec[x].push_back(y);
    vec[y].push_back(x);
  }
  return 0;
}
const long long MD = (long long)1000000007;
;
bool isvalid(long long xx, long long yy, long long n, long long m) {
  return (xx >= 0 && xx < n && yy >= 0 && yy < m);
}
long long pw(long long x, long long y, long long dr) {
  if (y == 0) return 1;
  long long o = y / 2;
  long long f = pw(x, o, dr) % dr;
  if (y % 2) {
    return (((f * f) % dr) * x) % dr;
  } else
    return (f * f) % dr;
}
int main() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  long long rst1 = 0, rst2 = 0;
  long long qu1 = 0, qu2 = 0;
  long long p = s.size() / 2;
  for (int i = 0; i < p; ++i) {
    if (s[i] == '?')
      qu1++;
    else
      rst1 += (s[i] - '0');
  }
  for (int i = p; i < s.size(); ++i) {
    if (s[i] == '?')
      qu2++;
    else
      rst2 += (s[i] - '0');
  }
  long long mn = min(qu1, qu2);
  qu1 -= mn;
  qu2 -= mn;
  if (qu1 < qu2) {
    swap(qu1, qu2);
    swap(rst1, rst2);
  }
  if (rst1 + (qu1 / 2) * (9) < rst2 || rst1 + (qu1 / 2) * (9) > rst2)
    cout << "Monocarp" << endl;
  else
    cout << "Bicarp" << endl;
  return 0;
}
