#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <bitset>
typedef long long LL;
using namespace std;

int main()
{
    int n,p,q;
    vector<int> v;
    int temp;
    set<int> u;
    cin>>n;
    cin>>p;
    for(int i=0;i<p;i++)
    {
        cin>>temp;
        v.push_back(temp);
    }
    cin>>q;
    for(int i=0;i<q;i++)
    {
        cin>>temp;
        v.push_back(temp);
    }
    sort(v.begin(),v.end());
    u.insert(v.begin(),v.end());
    if(u.size()==n)
        cout<<"I become the guy.";
    else
        cout<<"Oh, my keyboard!";
    return 0;
}