#include <bits/stdc++.h>
int main() {
  int n, i, j = 0, p1, q1, t, x;
  scanf("%d", &n);
  int p[n], q[n];
  scanf("%d", &p1);
  for (i = 0; i < p1; i++) {
    scanf("%d", &p[i]);
  }
  scanf("%d", &q1);
  for (i = 0; i < q1; i++) {
    scanf("%d", &q[i]);
  }
  if (n == 1 && p1 == 0 && q1 == 0) {
    printf("Oh, my keyboard!");
    return 0;
  }
  x = p1 + q1;
  int a[x];
  for (i = 0; i < p1; i++) {
    a[j] = p[i];
    j++;
  }
  for (i = 0; i < q1; i++) {
    a[j] = q[i];
    j++;
  }
  int k, l, m;
  for (k = 0; k < x; k++) {
    for (l = k + 1; l < x;) {
      if (a[l] == a[k]) {
        for (m = l; m < x; m++) {
          a[m] = a[m + 1];
        }
        x--;
      } else {
        l++;
      }
    }
  }
  for (i = 0; i < x; i++) {
    for (j = i + 1; j < x; j++) {
      if (a[i] > a[j]) {
        t = a[i];
        a[i] = a[j];
        a[j] = t;
      }
    }
  }
  int c = 0;
  for (i = 0; i < x - 1; i++) {
    c = c + a[i + 1] - a[i];
  }
  if ((n - c) != 1) {
    printf("Oh, my keyboard!");
    return 0;
  }
  for (i = 0; i < x - 1; i++) {
    if (a[i + 1] - a[i] > 1) {
      printf("Oh, my keyboard!");
      return 0;
    }
  }
  if ((n - c) == 1) printf("I become the guy.");
  return 0;
}
