import java.util.*;
public class Expressions {
static Vector v,u,w;
	public static void main(String[] args)
	{
		v=new Vector();
		u=new Vector();
		w=new Vector();
		Scanner s=new Scanner(System.in);
		int n=Integer.parseInt(s.nextLine());
		String str1=s.nextLine();
		String str2=s.nextLine();
		for(int i=1;i<n+1;i++)
		{
			    push(v,i);
		}
		for(int i=1;i<str1.length();i++)
			if(str1.charAt(i)>=48&&str1.charAt(i)<=57)
			{
				String st="";
				st=st+str1.charAt(i);
				push(u,Integer.parseInt(st));
			}

		for(int i=1;i<str2.length();i++)
			if(str2.charAt(i)>=48&&str2.charAt(i)<=57)
			{
				String st="";
				st=st+str2.charAt(i);
				push(w,Integer.parseInt(st));
			}

		while(v.size()!=0&&u.size()!=0&&w.size()!=0)
		{
			if(top(v)==top(u))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(u);
					pop(v);
				}
			}
			if(top(v)==top(w))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(w);
					pop(v);
				}
			}
		}
		if(v.size()==0)
			System.out.println("I become the guy.");
		else
			System.out.println("Oh, my keyboard!");
	}

	static void push(Vector v,int str)
	{
		v.add(str);
	}

	static int pop(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.remove(0);
	}

	static int top(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.get(0);
	}
}


import java.util.*;
public class Expressions {
static Vector v,u,w;
	public static void main(String[] args)
	{
		v=new Vector();
		u=new Vector();
		w=new Vector();
		Scanner s=new Scanner(System.in);
		int n=Integer.parseInt(s.nextLine());
		String str1=s.nextLine();
		String str2=s.nextLine();
		for(int i=1;i<n+1;i++)
		{
			    push(v,i);
		}
		String st1[]=str1.split(" ");
		String st2[]=str2.split(" ");
		for(int i=1;i<st1.length;i++)
		{
			push(u,Integer.parseInt(st1[i]));
		}
		for(int i=1;i<st2.length;i++)
		{
			push(w,Integer.parseInt(st2[i]));
		}
		Collections.sort(u);
		Collections.sort(w);
//		System.out.println(v);
//		System.out.println(u);
//		System.out.println(w);
		while(u.size()!=0||w.size()!=0)
		{
			if(top(v)==top(u))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(u);
					pop(v);
				}
			}
			else if(top(v)==top(w))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(w);
					pop(v);
				}
			}
			else
			{
				pop(w);
				pop(u);
			}
		}
		if(v.size()==0)
			System.out.println("I become the guy.");
		else
			System.out.println("Oh, my keyboard!");
	}

	static void push(Vector v,int str)
	{
		v.add(str);
	}

	static int pop(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.remove(0);
	}

	static int top(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.get(0);
	}
}


import java.util.*;
public class Expressions {
static Vector v,u,w;
	public static void main(String[] args)
	{
		v=new Vector();
		u=new Vector();
		w=new Vector();
		Scanner s=new Scanner(System.in);
		int n=Integer.parseInt(s.nextLine());
		String str1=s.nextLine();
		String str2=s.nextLine();
		for(int i=1;i<n+1;i++)
		{
			    push(v,i);
		}
		for(int i=1;i<str1.length();i++)
			if(str1.charAt(i)>=48&&str1.charAt(i)<=57)
			{
				String st="";
				st=st+str1.charAt(i);
				push(u,Integer.parseInt(st));
			}

		for(int i=1;i<str2.length();i++)
			if(str2.charAt(i)>=48&&str2.charAt(i)<=57)
			{
				String st="";
				st=st+str2.charAt(i);
				push(w,Integer.parseInt(st));
			}
		Collections.sort(u);
		Collections.sort(w);
		while(u.size()!=0||w.size()!=0)
		{
			if(top(v)==top(u))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(u);
					pop(v);
				}
			}
			else if(top(v)==top(w))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(w);
					pop(v);
				}
			}
			else
			{
				pop(w);
				pop(u);
			}
		}
		if(v.size()==0)
			System.out.println("I become the guy.");
		else
			System.out.println("Oh, my keyboard!");
	}

	static void push(Vector v,int str)
	{
		v.add(str);
	}

	static int pop(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.remove(0);
	}

	static int top(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.get(0);
	}
}


import java.util.*;
public class Expressions {
static Vector v,u,w;
	public static void main(String[] args)
	{
		v=new Vector();
		u=new Vector();
		w=new Vector();
		Scanner s=new Scanner(System.in);
		int n=Integer.parseInt(s.nextLine());
		String str1=s.nextLine();
		String str2=s.nextLine();
		for(int i=1;i<n+1;i++)
		{
			    push(v,i);
		}
		String st1[]=str1.split(" ");
		String st2[]=str2.split(" ");
		for(int i=0;i<st1.length;i++)
		{
			push(u,Integer.parseInt(st1[i]));
		}
		for(int i=0;i<st2.length;i++)
		{
			push(w,Integer.parseInt(st2[i]));
		}
		Collections.sort(u);
		Collections.sort(w);
		while(u.size()!=0||w.size()!=0)
		{
			if(top(v)==top(u))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(u);
					pop(v);
				}
			}
			else if(top(v)==top(w))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(w);
					pop(v);
				}
			}
			else
			{
				pop(w);
				pop(u);
			}
		}
		if(v.size()==0)
			System.out.println("I become the guy.");
		else
			System.out.println("Oh, my keyboard!");
	}

	static void push(Vector v,int str)
	{
		v.add(str);
	}

	static int pop(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.remove(0);
	}

	static int top(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.get(0);
	}
}


import java.util.*;
public class Expressions {
static Vector v,u,w;
	public static void main(String[] args)
	{
		v=new Vector();
		u=new Vector();
		w=new Vector();
		Scanner s=new Scanner(System.in);
		int n=Integer.parseInt(s.nextLine());
		String str1=s.nextLine();
		String str2=s.nextLine();
		for(int i=1;i<n+1;i++)
		{
			    push(v,i);
		}
		for(int i=1;i<str1.length();i++)
			if(str1.charAt(i)>=48&&str1.charAt(i)<=57)
			{
				String st="";
				st=st+str1.charAt(i);
				push(u,Integer.parseInt(st));
			}

		for(int i=1;i<str2.length();i++)
			if(str2.charAt(i)>=48&&str2.charAt(i)<=57)
			{
				String st="";
				st=st+str2.charAt(i);
				push(w,Integer.parseInt(st));
			}
		Collections.sort(u);
		Collections.sort(w);
		while(v.size()!=0&&u.size()!=0&&w.size()!=0)
		{
			if(top(v)==top(u))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(u);
					pop(v);
				}
			}
			else if(top(v)==top(w))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(w);
					pop(v);
				}
			}
			else
			{
				pop(w);
				pop(u);
			}
		}
		if(v.size()==0)
			System.out.println("I become the guy.");
		else
			System.out.println("Oh, my keyboard!");
	}

	static void push(Vector v,int str)
	{
		v.add(str);
	}

	static int pop(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.remove(0);
	}

	static int top(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.get(0);
	}
}


import java.util.*;
public class Expressions {
static Vector v,u,w;
	public static void main(String[] args)
	{
		v=new Vector();
		u=new Vector();
		w=new Vector();
		Scanner s=new Scanner(System.in);
		int n=Integer.parseInt(s.nextLine());
		String str1=s.nextLine();
		String str2=s.nextLine();
		for(int i=1;i<n+1;i++)
		{
			    push(v,i);
		}
		for(int i=1;i<str1.length();i++)
			if(str1.charAt(i)>=48&&str1.charAt(i)<=57)
			{
				String st="";
				st=st+str1.charAt(i);
				push(u,Integer.parseInt(st));
			}

		for(int i=1;i<str2.length();i++)
			if(str2.charAt(i)>=48&&str2.charAt(i)<=57)
			{
				String st="";
				st=st+str2.charAt(i);
				push(w,Integer.parseInt(st));
			}
		Collections.sort(u);
		Collections.sort(w);
		while(v.size()!=0&&u.size()!=0&&w.size()!=0)
		{
			if(top(v)==top(u))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(u);
					pop(v);
				}
			}
			if(top(v)==top(w))
			{
				if(top(u)==top(w))
				{
					pop(u);
					pop(v);
					pop(w);
				}
				else
				{
					pop(w);
					pop(v);
				}
			}
		}
		if(v.size()==0)
			System.out.println("I become the guy.");
		else
			System.out.println("Oh, my keyboard!");
	}

	static void push(Vector v,int str)
	{
		v.add(str);
	}

	static int pop(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.remove(0);
	}

	static int top(Vector v)
	{
		if(v.size()==0)
		{
			return '\0';
		}
		return  (int) v.get(0);
	}
}


import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class lol {

    public static void main(String[] args)
    {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int test = s.nextInt();
        int[] array = new int[test];
        for (int i = 0; i < test; i++)
        {
            array[i] = s.nextInt();
        }
        int test2 = s.nextInt();
        int[] array2 = new int[test2];
        for (int i = 0; i < test2; i++)
        {
            array2[i] = s.nextInt();
        }
        int[] arrayanswer = new int[test + test2];
        for(int i = 0; i < test + test2; i++)
        {
            arrayanswer[i] = 200;
        }
        for(int i = 0; i < test; i++)
        {
            arrayanswer[i] = array[i];
        }
        for(int i = 0; i < test2; i++)
        {
            int bolean = 0;
            for(int j = 0; j < test + test2; j++)
            {
                if(array2[i] == arrayanswer[j])
                {
                    bolean++;

                }
            }
            if(bolean == 0)
            {
                arrayanswer[test] = array2[i];
            }
        }
        int answer = 0;
        for(int i = 0; i < test + test2; i++)
        {
            if(arrayanswer[i] != 200)
            {
                answer++;
            }
        }
        if(answer == n)
        {
            System.out.println("I become the guy.");
        }
        else
        {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class lol {

    public static void main(String[] args)
    {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int test = s.nextInt();
        int[] array = new int[test];
        for (int i = 0; i < test; i++)
        {
            array[i] = s.nextInt();
        }
        int test2 = s.nextInt();
        int[] array2 = new int[test2];
        for (int i = 0; i < test2; i++)
        {
            array2[i] = s.nextInt();
        }
        int[] arrayanswer = new int[test + test2];
        for(int i = 0; i < test + test2; i++)
        {
            arrayanswer[i] = 200;
        }
        for(int i = 0; i < test; i++)
        {
            arrayanswer[i] = array[i];
        }
        for(int i = 0; i < test2; i++)
        {
            int bolean = 0;
            for(int j = 0; j < test + test2; j++)
            {
                if(array2[i] == arrayanswer[j])
                {
                    bolean++;

                }
            }
            if(bolean == 0)
            {
                arrayanswer[test] = array2[i];
            }
        }
        int answer = 0;
        for(int i = 0; i < test + test2; i++)
        {
            if(arrayanswer[i] != 200)
            {
                answer++;
            }
        }
        if(answer == n)
        {
            System.out.println("I become the guy.");
        }
        else
        {

            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class revesion {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        int test = s.nextInt();
        int[] array = new int[test];
        for(int i = 0; i < test; i++)
        {
            array[i] = s.nextInt();
        }
        int test2 = s.nextInt();
        int o = 0;
        int sum2 = 0;
        for(int i = 0; i < test2; i++)
        {
            o = 0;
            int k = s.nextInt();
            for(int j = 0; j < test; j++)
            {
                if(k == array[j])
                {
                    o++;
                }
            }
            if(o == 0)
            {
                sum2++;
            }
        }
        int answer = array.length + sum2;
        if(answer == n)
        {
            System.out.println("I become the guy.");
        }
        else
        {
            System.out.print("Oh, my keyboard!");
        }
    }
}


import java.util.HashSet;
import java.util.Scanner;

public class main {

	public static void main(String[] args) {

		Scanner myObj = new Scanner(System.in);

	System.out.println(sol(myObj));

		myObj.close();
	}

	public static String sol(Scanner obj)
	{
		int n = Integer.parseInt(obj.nextLine());

		HashSet<Integer> hash = new HashSet<>();

		for(int i = 1; i < n + 1; i++)
		{
			hash.add(i);
		}

		String s1 = obj.nextLine();

		String[] s1arr = s1.split(" ");

		String s2 = obj.nextLine();

		String[] s2arr = s2.split(" ");

		for(int i = 0; i < s1arr.length; i++)
		{
			int num = Integer.parseInt(s1arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I am the guy.";
		}
		for(int i = 0; i < s2arr.length; i++)
		{
			int num = Integer.parseInt(s2arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I am the guy.";
		}

		return "Oh, my keyboard!";

	}
}


import java.util.HashSet;
import java.util.Scanner;

public class main {

	public static void main(String[] args) {

		Scanner myObj = new Scanner(System.in);

	System.out.println(sol(myObj));

		myObj.close();
	}

	public static String sol(Scanner obj)
	{
		int n = Integer.parseInt(obj.nextLine());

		HashSet<Integer> hash = new HashSet<>();

		for(int i = 1; i < n + 1; i++)
		{
			hash.add(i);
		}

		int p = obj.nextInt();

		for(int i = 0; i < p; i++)
		{
			int num = obj.nextInt();

			if(hash.contains(num))
				hash.remove(num);
			if(hash.size() == 0)
				return "I become the guy.";

		}

		p = obj.nextInt();

		for(int i = 0; i < p; i++)
		{
			int num = obj.nextInt();

			if(hash.contains(num))
				hash.remove(num);
			if(hash.size() == 0)
				return "I become the guy.";
		}

		return "Oh, my keyboard!";
	}
}


package codef;

import java.util.HashSet;
import java.util.Scanner;

public class main {

	public static void main(String[] args) {

		Scanner myObj = new Scanner(System.in);

	System.out.println(sol(myObj));

		myObj.close();
	}

	public static String sol(Scanner obj)
	{
		int n = Integer.parseInt(obj.nextLine());

		HashSet<Integer> hash = new HashSet<>();

		for(int i = 1; i < n + 1; i++)
		{
			hash.add(i);
		}

		String s1 = obj.nextLine();

		String[] s1arr = s1.split(" ");

		String s2 = obj.nextLine();

		String[] s2arr = s2.split(" ");

		for(int i = 0; i < s1arr.length; i++)
		{
			int num = Integer.parseInt(s1arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I become the guy.";
		}
		for(int i = 0; i < s2arr.length; i++)
		{
			int num = Integer.parseInt(s2arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I become the guy.";
		}

		return "Oh, my keyboard!";

	}
}


import java.util.HashSet;
import java.util.Scanner;

public class main {

	public static void main(String[] args) {

		Scanner myObj = new Scanner(System.in);

	System.out.println(sol(myObj));

		myObj.close();
	}

	public static String sol(Scanner obj)
	{
		int n = Integer.parseInt(obj.nextLine());

		HashSet<Integer> hash = new HashSet<>();

		for(int i = 1; i < n + 1; i++)
		{
			hash.add(i);
		}

		String s1 = obj.nextLine();

		String[] s1arr = s1.split(" ");

		String s2 = obj.nextLine();

		String[] s2arr = s2.split(" ");

		for(int i = 0; i < s1arr.length; i++)
		{
			int num = Integer.parseInt(s1arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I become the guy.";
		}
		for(int i = 0; i < s2arr.length; i++)
		{
			int num = Integer.parseInt(s2arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I become the guy.";
		}

		return "Oh, my keyboard!";

	}
}


import java.util.HashSet;
import java.util.Scanner;

public class main {

	public static void main(String[] args) {

		Scanner myObj = new Scanner(System.in);

	System.out.println(sol(myObj));

		myObj.close();
	}

	public static String sol(Scanner obj)
	{
		int n = Integer.parseInt(obj.nextLine());

		HashSet<Integer> hash = new HashSet<>();

		for(int i = 1; i < n + 1; i++)
		{
			hash.add(i);
		}

		String s1 = obj.nextLine();

		String[] s1arr = s1.split(" ");

		String s2 = obj.nextLine();

		String[] s2arr = s2.split(" ");

		for(int i = 0; i < s1arr.length; i++)
		{
			int num = Integer.parseInt(s1arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I am the guy.";
		}
		for(int i = 0; i < s2arr.length; i++)
		{
			int num = Integer.parseInt(s2arr[i]);

			if(hash.contains(num))
				hash.remove(num);

			if(hash.size() == 0)
				return "I become the guy.";
		}

		return "Oh, my keyboard!";

	}
}


public class IWannaBeTheGuy {

	public static void main(String[] args) {
		FasterReader read = new  FasterReader();
		int n=read.nextInt();
		int[] t= new int[n+1];
		int p=read.nextInt();
		for(int i=0;i<p;i++) {
			int ai=read.nextInt();
			t[ai]=1;
		}
		int q=read.nextInt();
		for(int i=0;i<q;i++) {
			int ai=read.nextInt();
			t[ai]=1;
		}
		for(int i =1 ;i<=n;i++) {
			if(t[i]!=1) {
				System.out.println("Oh, my keyboard!");
				return;
			}
		}
		System.out.println( "I become the guy.");
	}

}


import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class IWannaBeTheGuy {

	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int n=input.nextInt();
		int p=input.nextInt();
		Set<Integer> t=new HashSet<Integer>();
		for(int i=0;i<2*p;i++) {
			t.add(input.nextInt());
		}
		if(t.size()==n) System.out.println("I become the guy.");
		else System.out.println("Oh, my keyboard!");

	}

}


import java.util.*;
public class IWannaBeTheGuy {

	public static void main(String[] args) {
		Scanner read = new  Scanner(System.in);
		int n=read.nextInt();
		int[] t= new int[n+1];
		int p=read.nextInt();
		for(int i=0;i<p;i++) {
			int ai=read.nextInt();
			t[ai]=1;
		}
		int q=read.nextInt();
		for(int i=0;i<q;i++) {
			int ai=read.nextInt();
			t[ai]=1;
		}
		for(int i =1 ;i<=n;i++) {
			if(t[i]!=1) {
				System.out.println("Oh, my keyboard!");
				return;
			}
		}
		System.out.println( "I become the guy.");
	}

}


import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class IWannaBeTheGuy {

	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int n=input.nextInt();
		int p=input.nextInt();
		Set<Integer> t=new HashSet<Integer>();
		int a=0;
		for(int i=0;i<p ;i++) {
			a=input.nextInt();
			t.add(a);
		}
		p=input.nextInt();
		for(int i=0;i<p ;i++) {
			a=input.nextInt();
			t.add(a);
		}
		if(t.size()==n) System.out.println("I become the guy.");
		else System.out.println("Oh, my keyboard!");
		input.close();
	}

}


import java.util.*;
public class bguy{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    Map<Integer,Integer> map=new HashMap<Integer,Integer>();
    int n1=sc.nextInt();
    for(int i=0;i<n1;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    int n2=sc.nextInt();
    for(int i=0;i<n2;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    System.out.println(map.size()==n?"I become the guy.":"Oh, my keyboard!");
  }
}


import java.util.*;
public class bguy{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    Map<Integer,Integer> map=new HashMap<Integer,Integer>();
    for(int i=0;i<n;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    for(int i=0;i<n-1;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    System.out.println(map.size()==n?"I become the guy.":"Oh, my keyboard!");
  }
}


import java.util.*;
public class bguy{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    Map<Integer,Integer> map=new HashMap<Integer,Integer>();
    for(int i=0;i<n;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    for(int i=0;i<n-1;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    System.out.println(map.size()==n?"I become the guy.":"Oh! my keyboard!");
  }
}


import java.util.*;
public class bguy{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    Map<Integer,Integer> map=new HashMap<Integer,Integer>();
    for(int i=0;i<n;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    for(int i=0;i<n-1;i++){
      int x=sc.nextInt();
      if(map.containsKey(x))
        continue;
      else{
        map.put(x,1);
      }
    }
    System.out.println(map.size()==n?"I become the guy":"Oh! my keyboard!");
  }
}


import java.util.Scanner;
import java.lang.Math;
import java.util.*;

public class Codeforces{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int n = Integer.parseInt(in.nextLine());
		int[] tot = new int[n];
		String[] p = in.nextLine().split(" ");
		String[] q = in.nextLine().split(" ");
		int[] pi = new int[p.length];
		int[] qi = new int[q.length];
		for(int i =0; i<p.length;i++) {
			int pI=Integer.parseInt(p[i]);
			if(pI!=0)
				tot[pI-1]=1;
		}
		for(int i =0; i<q.length;i++) {
			int qI = Integer.parseInt(q[i]);
			if(qI!=0)
				tot[qI-1]=1;
		}
		for(int i =0; i<n;i++)
			if(tot[i]==0) {
				System.out.println("Oh, my keyboard!");
				return;
			}
		System.out.println("I become the guy.");
	}
}


import java.util.Scanner;
import java.lang.Math;
import java.util.*;

public class Codeforces{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int n = Integer.parseInt(in.nextLine());
		int[] tot = new int[n];
		String[] p = in.nextLine().split(" ");
		String[] q = in.nextLine().split(" ");
		for(int i =1; i<p.length;i++) {
			int pI=Integer.parseInt(p[i]);
			if(pI!=0)
				tot[pI-1]=1;
		}
		for(int i =1; i<q.length;i++) {
			int qI = Integer.parseInt(q[i]);
			if(qI!=0)
				tot[qI-1]=1;
		}
		for(int i =0; i<n;i++)
			if(tot[i]==0) {
				System.out.println("Oh, my keyboard!");
				return;
			}
		System.out.println("I become the guy.");
	}
}


import java.util.Scanner;
import java.lang.Math;
import java.util.*;

public class Codeforces{
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int n = Integer.parseInt(in.nextLine());
		int[] tot = new int[n];
		String[] p = in.nextLine().split(" ");
		String[] q = in.nextLine().split(" ");
		int[] pi = new int[p.length];
		int[] qi = new int[q.length];
		for(int i =0; i<p.length;i++)
			tot[Integer.parseInt(p[i])-1]=1;
		for(int i =0; i<q.length;i++)
			tot[Integer.parseInt(q[i])-1]=1;
		for(int i =0; i<n;i++)
			if(tot[i]==0) {
				System.out.println("Oh, my keyboard!");
				return;
			}
		System.out.println("I become the guy.");
	}
}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner( System.in);
        int num=sc.nextInt();
            int n=sc.nextInt();
            int a[]= new int[n];
            for (int i=0;i<n;i++){
                a[i]=sc.nextInt();
            }
            int m=sc.nextInt();
            int b[]= new int[m];
            for (int i=0;i<m;i++){
                b[i]=sc.nextInt();
            }
            int j=0;
            int sum=0;
            int max=0;
        int max1=0;
            for (int i=0;i<n;i++) {
                if (max<a[i])max=a[i];
            }
            for (j=0;j<m;j++){
                if (max1<b[j])max1=b[j];
            }

            if (max>num||max1>num) {
                System.out.println("I become the guy.\n");
            }
            else{
                System.out.println("Oh, my keyboard!\n");

        }
    }
}


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner( System.in);
        int num=sc.nextInt();
            int n=sc.nextInt();
            int a[]= new int[n];
            for (int i=0;i<n;i++){
                a[i]=sc.nextInt();
            }
            int m=sc.nextInt();
            int b[]= new int[m];
            for (int i=0;i<m;i++){
                b[i]=sc.nextInt();
            }
            int j=0;
            int sum=0;
            int max=0;
        int max1=0;
            for (int i=0;i<n;i++) {
                if (max<a[i])max=a[i];
            }
            for (j=0;j<m;j++){
                if (max1<b[j])max1=b[j];
            }
//        System.out.println(max+" "+max1);

            if (max>=num||max1>=num) {
                System.out.println("I become the guy.\n");
            }
            else{
                System.out.println("Oh, my keyboard!\n");

        }
    }
}


import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner( System.in);
        int num=sc.nextInt();
            int n=sc.nextInt();
            int a[]= new int[n];
        Set<Integer> s= new HashSet<>();
            for (int i=0;i<n;i++){
                a[i]=sc.nextInt();
                s.add(a[i]);
            }
            int m=sc.nextInt();
            int b[]= new int[m];
            for (int i=0;i<m;i++){
                b[i]=sc.nextInt();
                s.add(b[i]);
            }
//        System.out.println(s);
            if (s.size()==num){
                System.out.println("I become the guy.\n");
            }
            else{
                System.out.println("Oh, my keyboard!\n");

            }

    }
}


import java.util.Scanner;
public class game
{
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n,p,q,i,j=0,k=0,l,c=0,index=0;
        n=s.nextInt();
        p=s.nextInt();
        int a[]=new int[250];
        for(i=0;i<p;i++)
        a[i]=s.nextInt();
        q=s.nextInt();
        for(i=p;i<p+q;i++)
        a[i]=s.nextInt();
         for (i= 0; i <p+q-1; i++)
        {
            index=i;
            for (l = i + 1; l < p+q; l++){
                if (a[l] < a[index]){
                    index = l;//searching for lowest index
                }
            }
             j = a[index];
            a[index] = a[i];
            a[i] = j;
        }

       for(i=0;i<p+q;i++)
       {
           if(a[i]!=a[i+1])
           k++;
        }
    if(k==n)
    System.out.println("I become the guy.");
    else
      System.out.println("Oh, my keyboard!");
    }
}


import java.util.Scanner;
public class game
{
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n,p,q,i,j=0,k=0,l,c=0,index=0;
        n=s.nextInt();
        p=s.nextInt();
        int a[]=new int[200];
        for(i=0;i<p;i++)
        a[i]=s.nextInt();
        q=s.nextInt();
        for(i=p;i<p+q;i++)
        a[i]=s.nextInt();
         for (i= 0; i <p+q-1; i++)
        {
            index=i;
            for (l = i + 1; l < p+q; l++){
                if (a[l] < a[index]){
                    index = l;//searching for lowest index
                }
            }
             j = a[index];
            a[index] = a[i];
            a[i] = j;
        }

       for(i=0;i<p+q;i++)
       {
           if(a[i]!=a[i+1])
           k++;
        }
    if(k==n)
    System.out.println("I become the guy.");
    else
      System.out.println("Oh, my keyboard!");
    }
}


import java.util.Scanner;
public class game
{
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n,p,q,i,k=0;
        n=s.nextInt();
        p=s.nextInt();
        int a[]=new int[p];
        for(i=0;i<p;i++)
        a[i]=s.nextInt();
        q=s.nextInt();
        int b[]=new int[q];
        for(i=0;i<q;i++)
        b[i]=s.nextInt();
        for(i=0;i<p;i++)
        {
        if(a[i]>=n)
        k=1;

    }
     for(i=0;i<q;i++)
        {
        if(b[i]>=n)
        k=1;

    }

    if(k==1)
    System.out.println("I become the guy.");
    else
      System.out.println("Oh, my keyboard!");
    }
}


import java.util.Scanner;
public class game
{
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n,p,q,i,j=0,k=0,l,c=0,index=0;
        n=s.nextInt();
        p=s.nextInt();
        int a[]=new int[200];
        for(i=0;i<p;i++)
        a[i]=s.nextInt();
        q=s.nextInt();
        for(i=p;i<p+q;i++)
        a[i]=s.nextInt();
         for (i= 0; i <p+q-1; i++)
        {
            index=i;
            for (l = i + 1; l < p+q; j++){
                if (a[l] < a[index]){
                    index = j;//searching for lowest index
                }
            }
             j = a[index];
            a[index] = a[i];
            a[i] = j;
        }

       for(i=0;i<p+q;i++)
       {
           if(a[i]!=a[i+1])
           k++;
        }
    if(k==n)
    System.out.println("I become the guy.");
    else
      System.out.println("Oh, my keyboard!");
    }
}


import java.util.Scanner;
public class game
{
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n,p,q,i,j=0,k=0,l,c=0;
        n=s.nextInt();
        p=s.nextInt();
        int a[]=new int[200];
        for(i=0;i<p;i++)
        a[i]=s.nextInt();
        q=s.nextInt();
        for(i=p;i<p+q;i++)
        a[i]=s.nextInt();
        for(i=0;i<p+q;i++)
        {
            j=a[i];
            for(l=i+1;l<p+q;l++)
            {
            if(j>a[l])
            {
               c=a[l];
               a[l]=j;
               j=c;
            }
        }
     }
       for(i=0;i<p+q;i++)
       {
           if(a[i]!=a[i+1])
           k++;
        }
    if(k==n)
    System.out.println("I become the guy.");
    else
      System.out.println("Oh, my keyboard!");
    }
}


import java.util.Scanner;
public class game
{
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n,p,q,i,k=0;
        n=s.nextInt();
        p=s.nextInt();
        int a[]=new int[p];
        for(i=0;i<p;i++)
        a[i]=s.nextInt();
        q=s.nextInt();
        int b[]=new int[q];
        for(i=0;i<q;i++)
        b[i]=s.nextInt();

        if(a[p-1]>=n)
        k=1;

        if(b[q-1]>=n)
        k=1;

    if(k==1)
    System.out.println("I become the guy.");
    else
      System.out.println("Oh, my keyboard!");
    }
}


import java.util.Scanner;
public class game
{
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int n,p,q,i,j=0,k=0,l,c=0,index=0;
        n=s.nextInt();
        p=s.nextInt();
        int a[]=new int[200];
        for(i=0;i<p;i++)
        a[i]=s.nextInt();
        q=s.nextInt();
        for(i=p;i<p+q;i++)
        a[i]=s.nextInt();
         for (i= 0; i <p+q-1; i++)
        {
            index=i;
            for (l = i + 1; l < p+q; l++){
                if (a[l] < a[index]){
                    index = j;//searching for lowest index
                }
            }
             j = a[index];
            a[index] = a[i];
            a[i] = j;
        }

       for(i=0;i<p+q;i++)
       {
           if(a[i]!=a[i+1])
           k++;
        }
    if(k==n)
    System.out.println("I become the guy.");
    else
      System.out.println("Oh, my keyboard!");
    }
}


import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        int levels = scanner.nextInt();
        int p = scanner.nextInt();
        int[] x = new int[p];

        for (int i = 0; i < p; i++)
            x[i] = scanner.nextInt();

        p = scanner.nextInt();
        int[] y = new int[p];

        for (int i = 0; i < p; i++)
            y[i] = scanner.nextInt();

        if (checkClearedLevels(x, y, levels))
            System.out.println("I become the guy.");
        else
            System.out.println("Oh, my keyboard!");

    }

    private static boolean checkClearedLevels(int[] x, int[] y, int levels) {

        Set<Integer> passedLevels = new HashSet<>();

        for (int i : x)
            passedLevels.add(i);

        if (passedLevels.size() != levels)
            for (int i : y)
                passedLevels.add(i);

        return passedLevels.size() == levels;
    }

}


import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        Set<Integer> set = new TreeSet<>();
        int q = 0;

        int n = scanner.nextInt();
        int p = scanner.nextInt();
        int e = scanner.nextInt();

        for (int i = 0; i < p * 2 - 1; i++) {

            e = scanner.nextInt();
            if (set.add(e) && i >= p)
                q++;

        }

        if (q - 1 < 0)
            System.out.println("Oh, my keyboard!");
        else
            System.out.println("I become the guy.");

    }

}


import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        Set<Integer> set = new TreeSet<>();

        int n = scanner.nextInt();
        int p = scanner.nextInt();
        int e = scanner.nextInt();
        int q = p;

        for (int i = 0; i < p - 1; i++) {
            e = scanner.nextInt();
            set.add(e);
        }

        p = scanner.nextInt();

        for (int i = 0; i < p; i++) {

            e = scanner.nextInt();
            if (set.add(e))
                q++;

        }

        if (q < n)
            System.out.println("Oh, my keyboard!");
        else
            System.out.println("I become the guy.");

    }

}


import java.util.*;
public class Solution{

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        boolean[] a = new boolean[n];
        int p = sc.nextInt();
        int i=0;
        while(i<p){
            int x = sc.nextInt();
            a[x-1] = true;
            i++;
        }
        int q = sc.nextInt();
        i=0;
        while(i<q){
            int x = sc.nextInt();
            a[x-1] = true;
            i++;
        }
        boolean c = true;
        for(i=0; i<n; i++){
            if(!a[i]){
                c = false;
                break;
            }
        }
        if(c){
            System.out.println("I become the guy.");
        }else{
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.*;
public class Solution{

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        boolean[] a = new boolean[n];
        while(sc.hasNext()){
            int i = sc.nextInt();
            if(i!=0)
                a[i-1] = true;
        }
        boolean c = true;
        for(int i=0; i<n; i++){
            if(!a[i]){
                c = false;
                break;
            }
        }
        if(!c){
            System.out.println("Oh, my keyboard!");
        }else{
            System.out.println("I become the guy.");
        }
    }
}


import java.util.*;
public class Solution{

    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        boolean[] a = new boolean[n];
        while(sc.hasNext()){
            int i = sc.nextInt();
            a[i-1] = true;
        }
        boolean c = true;
        for(int i=0; i<n; i++){
            if(!a[i]){
                c = false;
                break;
            }
        }
        if(!c){
            System.out.println("Oh, my keyboard!");
        }else{
            System.out.println("I become the guy.");
        }
    }
}


import java.util.*;
public class TestClass {
    public static void main(String args[] ) throws Exception {
        Scanner s = new Scanner(System.in);
        int n=s.nextInt();
        int p=s.nextInt();
        int c[]=new int[p*2];
        for(int i=0;i<p*2;i++){
            c[i]=s.nextInt();
        }
        int count=0;
        HashSet<Integer> h=new HashSet<>();
        for(int i=0;i<c.length;i++){
            h.add(c[i]);
        }
        boolean test=false;
        for(int i=1;i<=n;i++){
            if(h.contains(i)){
                test=true;
            }
            else
            test=false;
        }
        if(test==true){
            System.out.print("I become the guy.");
        }
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class TestClass {
    public static void main(String args[] ) throws Exception {
        Scanner s = new Scanner(System.in);
        int n=s.nextInt();
        int p=s.nextInt();
        int c[]=new int[p*2];
        for(int i=0;i<p*2;i++){
            c[i]=s.nextInt();
        }
        int count=0;
        HashSet<Integer> h=new HashSet<>();
        for(int i=0;i<c.length;i++){
            h.add(c[i]);
        }
        boolean test=false;
        for(int i=1;i<=n;i++){
            if(h.contains(i)){
                test=true;
            }
            else
            test=false;
        }
        if(test==true){
            System.out.print("I become the guy");
        }
        else
            System.out.print("oh, my keyboard!");
    }
}


import java.util.*;
public class TestClass {
    public static void main(String args[] ) throws Exception {
        Scanner s = new Scanner(System.in);
        int n=s.nextInt();
        int p=s.nextInt();
        int c[]=new int[p*2];
        for(int i=0;i<p*2;i++){
            c[i]=s.nextInt();
        }
        int count=0;
        HashSet<Integer> h=new HashSet<>();
        for(int i=0;i<c.length;i++){
            h.add(c[i]);
        }
        boolean test=false;
        for(int i=1;i<=n;i++){
            if(h.contains(i)){
                test=true;
            }
            else
            test=false;
        }
        if(test==true){
            System.out.print("I become the guy.");
        }
        else
            System.out.print("oh, my keyboard!");
    }
}


import java.util.*;
public class TestClass {
    public static void main(String args[] ) throws Exception {
        Scanner s = new Scanner(System.in);
        int n=s.nextInt();

        int p=s.nextInt();
        int c[]=new int[p];
        for(int i=0;i<p;i++)
            c[i]=s.nextInt();

        int q=s.nextInt();
        int b[]=new int[q];
        for(int i=0;i<q;i++)
            b[i]=s.nextInt();

        int count=0;
        HashSet<Integer> h=new HashSet<>();
        for(int i=0;i<c.length;i++){
            h.add(c[i]);
        }
        for(int i=0;i<b.length;i++){
            h.add(b[i]);
        }
        boolean test=false;
        for(int i=1;i<=n;i++){
            if(h.contains(i)){
                count++;
            }
        }
        if(count==n){
            System.out.print("I become the guy.");
        }
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class TestClass {
    public static void main(String args[] ) throws Exception {
        Scanner s = new Scanner(System.in);
        int n=s.nextInt();

        int p=s.nextInt();
        int c[]=new int[p];
        for(int i=0;i<p;i++)
            c[i]=s.nextInt();

        int q=s.nextInt();
        int b[]=new int[q];
        for(int i=0;i<q;i++)
            b[i]=s.nextInt();

        int count=0;
        HashSet<Integer> h=new HashSet<>();
        for(int i=0;i<c.length;i++){
            h.add(c[i]);
        }
        for(int i=0;i<b.length;i++){
            h.add(b[i]);
        }
        boolean test=false;
        for(int i=1;i<=n;i++){
            if(h.contains(i)){
                test=true;
            }
            else
            test=false;
        }
        if(test==true){
            System.out.print("I become the guy.");
        }
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        System.out.println(arr[p-1]+","+p);
        Arrays.sort(arr1);
        System.out.println(arr1[q-1]+","+q);

        if(arr[p-1]==n || arr[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        Arrays.sort(arr1);
        if(arr[p-1]==n || arr[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        Arrays.sort(arr1);
        if(arr[p-1]==n || arr[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        System.out.println(arr[p-1]+","+p+","+n);
        Arrays.sort(arr1);
        System.out.println(arr1[q-1]+","+q);

        if(arr[p-1]==n || arr[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        System.out.println(arr[p-1]+","+p+","+n);
        Arrays.sort(arr1);
        System.out.println(arr1[q-1]+","+q);

        if(arr[p-1]==n || arr[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);

        Arrays.sort(arr1);

        if(arr[p-1]==n || arr1[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        LinkedHashSet<Integer> h = new LinkedHashSet<Integer>();
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
            h.add(arr[i]);
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
            h.add(arr1[i]);
        }

        if(h.size()==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        System.out.println(arr+","+p);
        Arrays.sort(arr1);
        System.out.println(arr1+","+q);

        if(arr[p-1]==n || arr[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
        }
        Arrays.sort(arr);
        System.out.println(arr);
        Arrays.sort(arr1);
        System.out.println(arr1);

        if(arr[p-1]==n || arr[q-1]==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.util.*;
public class java{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int arr[] = new int[p];
        LinkedHashSet<Integer> h = new LinkedHashSet<Integer>();
        for(int i=0;i<p;i++){
            arr[i] = sc.nextInt();
            h.add(arr[i]);
        }
        int q = sc.nextInt();
        int arr1[] = new int[q];
        for(int i=0;i<q;i++){
            arr1[i] = sc.nextInt();
            h.add(arr1[i]);
        }
        LinkedHashSet<Integer> h = new LinkedHashSet<Integer>();

        if(h.size()==n){
            System.out.println("I become the guy.");
        }
        else
        System.out.println("Oh, my keyboard!");
    }
}


import java.io.*;
import java.util.*;
public class roxanne {
public static void main(String[] args) {
	Scanner input=new Scanner(System.in);
int n=	input.nextInt();
int p=input.nextInt();
boolean[] arr=new boolean[n];
for(int i=0;i<p;i++) {
	arr[input.nextInt()-1]=true;
}
int q=input.nextInt();
for(int i=0;i<q;i++) {
	arr[input.nextInt()-1]=true;
}
for(int i=0;i<n;i++) {
	if(arr[i]==false) {
		System.out.println("Oh, my keyboard!");return;
	}
}
System.out.println("I become the guy.");
}

}


import java.io.*;
import java.util.*;
public class roxanne {
public static void main(String[] args) {
	Scanner input=new Scanner(System.in);
int n=	input.nextInt();
int p=input.nextInt();
boolean[] arr=new boolean[n];
for(int i=0;i<p;i++) {
	arr[input.nextInt()-1]=true;
}
int q=input.nextInt();
for(int i=0;i<q;i++) {
	arr[input.nextInt()-1]=true;
}
for(int i=0;i<n;i++) {
	if(arr[i]==false) {
		System.out.println("Oh, my keyboard!");return;
	}
}
System.out.println("I become the guy.");
}


package s�mestr;
import java.io.*;
import java.util.*;
public class roxanne {
public static void main(String[] args) {
	Scanner input=new Scanner(System.in);
int n=	input.nextInt();
int p=input.nextInt();
boolean[] arr=new boolean[n];
for(int i=0;i<p;i++) {
	arr[input.nextInt()-1]=true;
}
int q=input.nextInt();
for(int i=0;i<q;i++) {
	arr[input.nextInt()-1]=true;
}
for(int i=0;i<n;i++) {
	if(arr[i]==false) {
		System.out.println("Oh, my keyboard!");return;
	}
}
System.out.println("I become the guy.");
}

}


import java.util.Scanner;
public class IWannaBetheGuy {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int p = scan.nextInt();
        String s = "Oh, my keyboard!";
        String c = "I become the guy.";
        int[] arr = new int[n];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = i + 1;
        }
        for (int i = 0; i < p; i++) {
            int k = scan.nextInt();
            for (int j = 0; j < arr.length; j++) {
                if (arr[j] == -1) {
                    continue;
                } else if (arr[j] == k) {
                    arr[j] = -1;
                }
            }
        }
        int q = scan.nextInt();
        for (int i = 0; i < q; i++) {
            int k = scan.nextInt();
            for (int j = 0; j < arr.length; j++) {
                if (arr[j] == -1) {
                    continue;
                } else if (arr[j] == k) {
                    arr[j] = -1;
                }
            }
        }
        for (int i : arr) {
            if (!(i == -1)) {
                System.out.println(s);
                return;
            }
        }
//
        System.out.println(c);
    }
}


import java.util.Scanner;

public class IWannaBetheGuy {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int p = scan.nextInt();
        String s = "Oh, my keyboard!";
        String c = "I become the guy.";
        int[] arr = new int[n];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = i + 1;
        }
        for (int i = 0; i < p; i++) {
            int k = scan.nextInt();
            for (int j = 0; j < arr.length; j++) {
                if (arr[j] == -1) {
                    continue;
                } else if (arr[j] == k) {
                    arr[j] = -1;
                }
            }
        }
        int q = scan.nextInt();
        for (int i = 0; i < q; i++) {
            int k = scan.nextInt();
            for (int j = 0; j < arr.length; j++) {
                if (arr[j] == -1) {
                    continue;
                } else if (arr[j] == k) {
                    arr[j] = -1;
                }
            }
        }
        for (int i : arr) {
            if (!(i == -1)) {
                System.out.println(s);
                return;
            }
        }
//
        System.out.println(c);
    }
}


import java.util.Scanner;

public class IWannaBetheGuy {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int p = scan.nextInt();
        String s = "Oh, my keyboard!";
        String c = "I become the guy.";
        int[] arr = new int[n];
        for (int i = 0; i < arr.length; i++) {
            arr[i] = i + 1;
        }
        for (int i = 0; i < p; i++) {
            int k = scan.nextInt();
            for (int j = 0; j < arr.length; j++) {
                if (arr[j] == -1) {
                    continue;
                } else if (arr[j] == k) {
                    arr[j] = -1;
                }
            }
        }
        int q = scan.nextInt();
        for (int i = 0; i < q; i++) {
            int k = scan.nextInt();
            for (int j = 0; j < arr.length; j++) {
                if (arr[j] == -1) {
                    continue;
                } else if (arr[j] == k) {
                    arr[j] = -1;
                }
            }
        }
        for (int i : arr) {
            if (!(i == -1)) {
                System.out.println(s);
                return;
            }
        }
        System.out.println(c);
    }
}


import java .util.Scanner ;
import java.util.*;
import java.io.*;
import java.math.BigInteger;
import java.nio.IntBuffer;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
//import java.io.OutputStreamReader;
import java.io.PrintWriter;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.lang.Math;
import java.util.Arrays;
import java.util.Collections;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.InputMismatchException;
import java.awt.Point;

public class cf2{

    public static void main(final String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter w = new PrintWriter(outputStream);

        int n =in.nextInt();
        int p=in.nextInt();
        int[] arr =new int[p];
        int flag=0;
        for(int i=0; i<p; i++ ){
            arr[i]=in.nextInt();
        }
        for(int j =0; j<p ; j++){
            if(arr[j]==n){
                flag =1;
                //break;
            }
        }
        int q=in.nextInt();
        int[] arr2=new int[q];
        int flag2=0;
        for(int g=0; g<q; g++){
            arr2[g]=in.nextInt();
        }
        for(int h =0; h<q; h++){
            if(arr2[h]==n){
                flag2=1;
                //break;
            }
        }
        if(flag==1 || flag2==1){
            System.out.println("I become the guy.");
        }
        else {
            System.out.println("Oh, my keyboard!");
        }
    }
}

class InputReader {
    private final InputStream stream;
    private final byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private InputReader.SpaceCharFilter filter;
    private final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    public InputReader(final InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        if (numChars == -1)
            throw new InputMismatchException();

        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (final IOException e) {
                throw new InputMismatchException();
            }

            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (final IOException e) {
            e.printStackTrace();
        }
        return str;
    }

    public int nextInt() {
        int c = read();

        while (isSpaceChar(c))
            c = read();

        int sgn = 1;

        if (c == '-') {
            sgn = -1;
            c = read();
        }

        int res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));

        return res * sgn;
    }

    public long nextLong() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;

        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public double nextDouble() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        double res = 0;
        while (!isSpaceChar(c) && c != '.') {
            if (c == 'e' || c == 'E')
                return res * Math.pow(10, nextInt());
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        }
        if (c == '.') {
            c = read();
            double m = 1;
            while (!isSpaceChar(c)) {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                m /= 10;
                res += (c - '0') * m;
                c = read();
            }
        }
        return res * sgn;
    }

    public String readString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        final StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));

        return res.toString();
    }

    public boolean isSpaceChar(final int c) {
        if (filter != null)
            return filter.isSpaceChar(c);
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public String next() {
        return readString();
    }

    public interface SpaceCharFilter {
        public boolean isSpaceChar(int ch);
    }
}


import java .util.Scanner ;
import java.util.*;
import java.io.*;
import java.math.BigInteger;
import java.nio.IntBuffer;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
//import java.io.OutputStreamReader;
import java.io.PrintWriter;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.lang.Math;
import java.util.Arrays;
import java.util.Collections;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.InputMismatchException;
import java.awt.Point;

public class cf2{

    public static void main(final String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter w = new PrintWriter(outputStream);

        Set<Integer> set=new HashSet<Integer>();
        int n =in.nextInt();
        int p=in.nextInt();
        int[] arr =new int[p];
        //int flag=0;
        for(int i=0; i<p; i++ ){
            arr[i]=in.nextInt();
            set.add(arr[i]);
        }
        /*for(int j =0; j<p ; j++){
            if(arr[j]==n){
                flag =1;
                break;
            }
        }*/
        int q=in.nextInt();
        int[] arr2=new int[q];
        //int flag2=0;
        for(int g=0; g<q; g++){
            arr2[g]=in.nextInt();
            set.add(arr2[g]);
        }
        /*for(int h =0; h<q; h++){
            if(arr2[h]==n){
                flag2=1;
                break;
            }
        }*/
        /*if(flag==1 || flag2==1){
            System.out.println("I become the guy.");
        }
        else {
            System.out.println("Oh, my keyboard!");
        }*/
        if(set.size()==n){
            System.out.println("I become the guy.");
        }
        else {
            System.out.println("Oh, my keyboard!");
        }

    }
}

class InputReader {
    private final InputStream stream;
    private final byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private InputReader.SpaceCharFilter filter;
    private final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    public InputReader(final InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        if (numChars == -1)
            throw new InputMismatchException();

        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (final IOException e) {
                throw new InputMismatchException();
            }

            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (final IOException e) {
            e.printStackTrace();
        }
        return str;
    }

    public int nextInt() {
        int c = read();

        while (isSpaceChar(c))
            c = read();

        int sgn = 1;

        if (c == '-') {
            sgn = -1;
            c = read();
        }

        int res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));

        return res * sgn;
    }

    public long nextLong() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;

        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public double nextDouble() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        double res = 0;
        while (!isSpaceChar(c) && c != '.') {
            if (c == 'e' || c == 'E')
                return res * Math.pow(10, nextInt());
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        }
        if (c == '.') {
            c = read();
            double m = 1;
            while (!isSpaceChar(c)) {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                m /= 10;
                res += (c - '0') * m;
                c = read();
            }
        }
        return res * sgn;
    }

    public String readString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        final StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));

        return res.toString();
    }

    public boolean isSpaceChar(final int c) {
        if (filter != null)
            return filter.isSpaceChar(c);
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public String next() {
        return readString();
    }

    public interface SpaceCharFilter {
        public boolean isSpaceChar(int ch);
    }
}


import java .util.Scanner ;
import java.util.*;
import java.io.*;
import java.math.BigInteger;
import java.nio.IntBuffer;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
//import java.io.OutputStreamReader;
import java.io.PrintWriter;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.lang.Math;
import java.util.Arrays;
import java.util.Collections;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.InputMismatchException;
import java.awt.Point;

public class cf2{

    public static void main(final String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter w = new PrintWriter(outputStream);

        int n =in.nextInt();
        int p=in.nextInt();
        int[] arr =new int[p];
        int flag=0;
        for(int i=0; i<p; i++ ){
            arr[i]=in.nextInt();
        }
        for(int j =0; j<p ; j++){
            if(arr[j]==n){
                flag =1;
                break;
            }
        }
        int q=in.nextInt();
        int[] arr2=new int[q];
        int flag2=0;
        for(int g=0; g<q; g++){
            arr2[g]=in.nextInt();
        }
        for(int h =0; h<q; h++){
            if(arr2[h]==n){
                flag2=1;
                break;
            }
        }
        if(flag==1 || flag2==1){
            System.out.println("I become the guy.");
        }
        else {
            System.out.println("Oh, my keyboard!");
        }
    }
}

class InputReader {
    private final InputStream stream;
    private final byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private InputReader.SpaceCharFilter filter;
    private final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    public InputReader(final InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        if (numChars == -1)
            throw new InputMismatchException();

        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (final IOException e) {
                throw new InputMismatchException();
            }

            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (final IOException e) {
            e.printStackTrace();
        }
        return str;
    }

    public int nextInt() {
        int c = read();

        while (isSpaceChar(c))
            c = read();

        int sgn = 1;

        if (c == '-') {
            sgn = -1;
            c = read();
        }

        int res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));

        return res * sgn;
    }

    public long nextLong() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;

        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public double nextDouble() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        double res = 0;
        while (!isSpaceChar(c) && c != '.') {
            if (c == 'e' || c == 'E')
                return res * Math.pow(10, nextInt());
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        }
        if (c == '.') {
            c = read();
            double m = 1;
            while (!isSpaceChar(c)) {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                m /= 10;
                res += (c - '0') * m;
                c = read();
            }
        }
        return res * sgn;
    }

    public String readString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        final StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));

        return res.toString();
    }

    public boolean isSpaceChar(final int c) {
        if (filter != null)
            return filter.isSpaceChar(c);
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public String next() {
        return readString();
    }

    public interface SpaceCharFilter {
        public boolean isSpaceChar(int ch);
    }
}


//package com.proglang;

import java.util.HashMap;
import java.util.Scanner;

public class IWannaBeTheGuy2 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        HashMap<Integer, Boolean> levels = new HashMap<>();

        int p = scanner.nextInt();
        while (p-- >= 1)
            levels.put(scanner.nextInt(), true);

        int q = scanner.nextInt();
        while (q-- >= 1)
            levels.put(scanner.nextInt(), true);

        boolean flag = true;
        for (int i=1; i<=n; i++) {
            if (!levels.containsKey(i))
                flag = false;
                break;
        }

        if (flag)
            System.out.println("I become the guy.");
        else
            System.out.println("Oh, my keyboard!");

        scanner.close();
    }
}


//package com.proglang;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class IWannaBeTheGuy {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        scanner.nextLine();
        HashMap<Integer, Boolean> levels = new HashMap<>();
        int[] x = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
        int[] y = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();

        for (int level: x)
            levels.put(level, true);

        for (int level: y)
            levels.put(level, true);

        boolean flag = true;
        for (int i=1; i<=n; i++) {
            if (!levels.containsKey(i)) {
                flag = false;
                break;
            }
        }
        if (flag)
            System.out.println("I become the guy.");
        else
            System.out.println("Oh, my keyboard!");
    }
}


//package com.proglang;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class IWannaBeTheGuy {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        scanner.nextLine();
        HashMap<Integer, Boolean> levels = new HashMap<>();
        int[] x = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
        int[] y = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();

        for (int level: x)
            levels.put(level, true);

        for (int level: y)
            levels.put(level, true);

        if (levels.containsKey(n))
            System.out.println("I become the guy.");
        else
            System.out.println("Oh, my keyboard!");
    }
}


//package com.proglang;

import java.util.HashMap;
import java.util.Scanner;

public class IWannaBeTheGuy2 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        HashMap<Integer, Boolean> levels = new HashMap<>();

        int p = scanner.nextInt();
        while (p-- >= 1)
            levels.put(scanner.nextInt(), true);

        int q = scanner.nextInt();
        while (q-- >= 1)
            levels.put(scanner.nextInt(), true);

        System.out.println(levels);
        boolean flag = true;
        for (int i=1; i<=n; i++) {
            if (!levels.containsKey(i)) {
                flag = false;
                break;
            }
        }

        if (flag)
            System.out.println("I become the guy.");
        else
            System.out.println("Oh, my keyboard!");

        scanner.close();
    }
}


//package com.proglang;

import java.util.*;

public class IWannaBeTheGuy {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        Set<Integer> levels = new HashSet<>();
        int p = scanner.nextInt();

        while (p-- >= 1)
            levels.add(scanner.nextInt());

        int q = scanner.nextInt();
        while (q-- >= 1)
            levels.add(scanner.nextInt());

        if (levels.size() == n)
            System.out.println("I become the guy.");
        else
            System.out.println("Oh, my keyboard!");

        scanner.close();
    }
}


//package com.proglang;

import java.util.HashMap;
import java.util.Scanner;

public class IWannaBeTheGuy2 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        HashMap<Integer, Boolean> levels = new HashMap<>();

        int p = scanner.nextInt();
        while (p-- >= 1)
            levels.put(scanner.nextInt(), true);

        int q = scanner.nextInt();
        while (q-- >= 1)
            levels.put(scanner.nextInt(), true);

        boolean flag = true;
        for (int i=1; i<=n; i++) {
            if (!levels.containsKey(i)) {
                flag = false;
                break;
            }
        }

        if (flag)
            System.out.println("I become the guy.");
        else
            System.out.println("Oh, my keyboard!");

        scanner.close();
    }
}


import java.util.Scanner;
public class iwannabetheguy {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		scan.nextLine();
		String s1 = scan.nextLine();
		s1 = s1.substring(2);
		String s2 = scan.nextLine();
		s2 = s2.substring(2);
		s1 = s1.concat(" " + s2);
		boolean bol = true;
		for (int i = 1 ; i <= n && bol ; i++) {
			if (!s1.contains(String.valueOf(i))) bol = false;
		}
		if (bol) System.out.println("I become the guy.");
		else System.out.println("Oh, my keyboard!");
	}
}


import java.util.Scanner;
public class iwannabetheguy {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		scan.nextLine();
		String res = "";
		int n1 = scan.nextInt();
		for (int i = 0 ; i < n1 ; i++) {
			int j = scan.nextInt();
			res += String.valueOf(j) + " ";
		}
		int n2 = scan.nextInt();
                for (int i = 0 ; i < n2 ; i++) {
                        int j = scan.nextInt();
                        res += String.valueOf(j) + " ";
                }
		boolean bol = true;
		for (int i = 1 ; i <= n && bol ; i++) {
			if (!res.contains(String.valueOf(i))) bol = false;
		}
		if (bol) System.out.println("I become the guy.");
		else System.out.println("Oh, my keyboard!");
	}
}


import java.util.Scanner;
public class iwannabetheguy {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		scan.nextLine();
		String s1 = scan.nextLine();
		String s2 = scan.nextLine();
		s1 = s1.concat(s2);
		boolean bol = true;
		for (int i = 1 ; i <= n && bol ; i++) {
			if (!s1.contains(String.valueOf(i))) bol = false;
		}
		if (bol) System.out.println("I become the guy.");
		else System.out.println("Oh, my keyboard!");
	}
}


import java.util.Scanner;
public class iwannabetheguy {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		scan.nextLine();
		String res = "";
		int n1 = scan.nextInt();
		for (int i = 0 ; i < n1 ; i++) {
			int j = scan.nextInt();
			res += String.valueOf(j) + " ";
		}
		int n2 = scan.nextInt();
                for (int i = 0 ; i < n2 ; i++) {
                        int j = scan.nextInt();
                        res += String.valueOf(j) + " ";
                }
		System.out.println(res);
		boolean bol = true;
		for (int i = 1 ; i <= n && bol ; i++) {
			if (!res.contains(String.valueOf(i))) bol = false;
		}
		if (bol) System.out.println("I become the guy.");
		else System.out.println("Oh, my keyboard!");
	}
}


import java.util.Scanner;
public class iwannabetheguy {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		scan.nextLine();
		String s1 = scan.nextLine();
		s1 = s1.substring(2);
		String s2 = scan.nextLine();
		s2 = s2.substring(2);
		s1 = s1.concat(" " + s2);
		System.out.println(s1);
		boolean bol = true;
		for (int i = 1 ; i <= n && bol ; i++) {
			if (!s1.contains(String.valueOf(i))) bol = false;
		}
		if (bol) System.out.println("I become the guy.");
		else System.out.println("Oh, my keyboard!");
	}
}


import java.util.*;
public class A
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int p=sc.nextInt();
        ArrayList<Integer> a=new ArrayList<>();
        for(int i=0;i<2*p;i++)
            a.add(sc.nextInt());
        int min=Collections.min(a);
        int max=Collections.max(a);
        if(min==1 && max==n)
            System.out.print("I become the guy.");
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class A
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int p=sc.nextInt();
        ArrayList<Integer> a=new ArrayList<>();
        for(int i=0;i<2*p;i++)
            a.add(sc.nextInt());
        int min=Collections.min(a);
        int max=Collections.max(a);
        if(min==1 && max==n)
            System.out.print("I become the guy");
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class A
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int p=sc.nextInt();
        ArrayList<Integer> a=new ArrayList<>();
        for(int i=0;i<p;i++)
            a.add(sc.nextInt());
        int p1=sc.nextInt();
        ArrayList<Integer> a1=new ArrayList<>();
        for(int i=0;i<p1;i++)
            a1.add(sc.nextInt());
        a.addAll(a1);
        int min=Collections.min(a);
        int max=Collections.max(a);
        if(min==1 && max==n)
            System.out.print("I become the guy.");
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class A
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int p=sc.nextInt();
        ArrayList<Integer> a=new ArrayList<>();
        for(int i=0;i<p;i++)
            a.add(sc.nextInt());
        int p1=sc.nextInt();
        ArrayList<Integer> a1=new ArrayList<>();
        for(int i=0;i<p1;i++)
            a1.add(sc.nextInt());
        a.addAll(a1);
        int min=Collections.min(a);
        int max=Collections.max(a);
        if(min==1 && max==n)
            System.out.print("I become the guy");
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class A
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int p=sc.nextInt();
        int a[]=new int[2*p];
        for(int i=0;i<2*p;i++)
            a[i]=sc.nextInt();
        int min=Colections.min(Arrays.asList(a));
        int max=Colections.max(Arrays.asList(a));
        if(min==1 && max==n)
            System.out.print("I become the guy");
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class A
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int p=sc.nextInt();
        ArrayList<Integer> a=new ArrayList<>();
        for(int i=0;i<p;i++)
            a.add(sc.nextInt());
        int p1=sc.nextInt();
        ArrayList<Integer> a1=new ArrayList<>();
        for(int i=0;i<p1;i++)
            a1.add(sc.nextInt());
        a.addAll(a1);
        a1.clear();
        for(int i=1;i<=n;i++)
            a1.add(i);
        if(a.containsAll(a1))
            System.out.print("I become the guy.");
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
public class A
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int p=sc.nextInt();
        int a[]=nw int[2*p];
        for(int i=0;i<2*p;i++)
            a[i]=sc.nextInt();
        int min=Colections.min(Arrays.asList(a));
        int max=Colections.max(Arrays.asList(a));
        if(min==1 && max==n)
            System.out.print("I become the guy");
        else
            System.out.print("Oh, my keyboard!");
    }
}


import java.util.*;
import java.io.*;

public class IWannaBeTheGuy{
   public static void main(String[] args) throws IOException{
      BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
      int n=Integer.parseInt(br.readLine());
      Set<Integer> levels=new TreeSet<Integer>();
      for(int i=0; i<2; i++){
         StringTokenizer st=new StringTokenizer(br.readLine(), " ");
         st.nextToken();
         while(st.hasMoreTokens()) levels.add(Integer.parseInt(st.nextToken()));
      }
      System.out.println(levels.size()==n?"I become the guy.":"Oh, my keyboard!");
   }
}


import java.util.*;
import java.io.*;

public class IWannaBeTheGuy{
   public static void main(String[] args) throws IOException{
      BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
      int n=Integer.parseInt(br.readLine());
      Set<Integer> levels=new HashSet<Integer>();
      for(int i=0; i<2; i++){
         StringTokenizer st=new StringTokenizer(br.readLine(), " ");
         st.nextToken();
         while(st.hasMoreTokens()) levels.add(Integer.parseInt(st.nextToken()));
      }
      System.out.println(levels.size()==n?"I become the guy":"Oh, my keyboard!");
   }
}


import java.util.*;
import java.io.*;

public class IWannaBeTheGuy{
   public static void main(String[] args) throws IOException{
      BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
      int n=Integer.parseInt(br.readLine());
      Set<Integer> levels=new TreeSet<Integer>();
      for(int i=0; i<2; i++){
         StringTokenizer st=new StringTokenizer(br.readLine(), " ");
         st.nextToken();
         while(st.hasMoreTokens()) levels.add(Integer.parseInt(st.nextToken()));
      }
      System.out.println(levels.contains(n)?"I become the guy":"Oh, my keyboard!");
   }
}


import java.util.*;
import java.io.*;

public class IWannaBeTheGuy{
   public static void main(String[] args) throws IOException{
      BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
      int n=Integer.parseInt(br.readLine());
      Set<Integer> levels=new HashSet<Integer>();
      for(int i=0; i<2; i++){
         StringTokenizer st=new StringTokenizer(br.readLine(), " ");
         st.nextToken();
         while(st.hasMoreTokens()) levels.add(Integer.parseInt(st.nextToken()));
      }
      System.out.println(levels.size()>=n?"I become the guy":"Oh, my keyboard!");
   }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        String str2 = read.nextLine();
        boolean len1 = false;
        boolean len2 = false;
        boolean found = true;
        String str1Split = "";
        String str2Split = "";
        if (str1.length() > 2) {
            len1 = true;
            str1Split = str1.substring(2);
        }
        if (str2.length() > 2) {
            len2 = true;
            str2Split = str2.substring(2);
        }
        if (str1.equals("0") && str2.equals("0")) {
            found = false;
        } else {
            if (len1 == true || len2 == true) {

                found = true;
                for (int i = 1; i < n + 1; i++) {
                    String iWord = Integer.toString(i);
                    if (!(str1Split.contains(iWord) || str2Split.contains(iWord))) {
                        found = false;
                        break;
                    }
                }
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
	// write your code here
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        String str2 = read.nextLine();
        boolean found = true;
        for (int i = 1; i < n+1; i++) {
            String iWord = Integer.toString(i);
            if (!(str1.contains(iWord) || str2.contains(iWord))) {
                found = false;
                break;
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        String str2 = read.nextLine();
        String str1Split = str1.substring(2);
        String str2Split = str2.substring(2);
        boolean len1 = false;
        boolean len2 = false;
        boolean found = true;
        if (str1.length() > 2) {
            len1 = true;
        }
        if (str2.length() > 2) {
            len2 = true;
        }
        if (len1 == true || len2 == true) {
            found = true;
            for (int i = 1; i < n + 1; i++) {
                String iWord = Integer.toString(i);
                if (!(str1Split.contains(iWord) || str2Split.contains(iWord))) {
                    found = false;
                    break;
                }
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        String str2 = read.nextLine();
        String str1Split = str1.substring(2);
        String str2Split = str2.substring(2);
        boolean len1 = false;
        boolean len2 = false;
        boolean found = true;
        if (str1.length() > 2) {
            len1 = true;
        }
        if (str2.length() > 2) {
            len2 = true;
        }
        if (len1 == true || len2 == true) {
            found = true;
            for (int i = 1; i < n + 1; i++) {
                String iWord = Integer.toString(i);
                if (!(str1Split.contains(iWord) || str2Split.contains(iWord))) {
                    found = false;
                    break;
                }
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        String str2 = read.nextLine();
        boolean len1 = false;
        boolean len2 = false;
        boolean found = true;
        String str1Split = "";
        String str2Split = "";
        if (str1.length() > 2) {
            len1 = true;
            str1Split = str1.substring(2);
        }
        if (str2.length() > 2) {
            len2 = true;
            str2Split = str2.substring(2);
        }
        if (len1 == true || len2 == true) {

            found = true;
            for (int i = 1; i < n + 1; i++) {
                String iWord = Integer.toString(i);
                if (!(str1Split.contains(iWord) || str2Split.contains(iWord))) {
                    found = false;
                    break;
                }
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        read.nextLine();
        String str2 = read.nextLine();
        String str1Split = str1.substring(2);
        String str2Split = str2.substring(2);
        boolean len1 = false;
        boolean len2 = false;
        boolean found = true;
        if (str1.length() > 2) {
            len1 = true;
        }
        if (str2.length() > 2) {
            len2 = true;
        }
        if (len1 == true || len2 == true) {
            found = true;
            for (int i = 1; i < n + 1; i++) {
                String iWord = Integer.toString(i);
                if (!(str1Split.contains(iWord) || str2Split.contains(iWord))) {
                    found = false;
                    break;
                }
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
	// write your code here
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        String str2 = read.nextLine();
        String str1Split = str1.substring(2);
        String str2Split = str2.substring(2);
        boolean found = true;
        for (int i = 1; i < n+1; i++) {
            String iWord = Integer.toString(i);
            if (!(str1Split.contains(iWord) || str2Split.contains(iWord))) {
                found = false;
                break;
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // write your code here
        Scanner read = new Scanner(System.in);
        int n = read.nextInt();
        read.nextLine();
        String str1 = read.nextLine();
        String str2 = read.nextLine();
        String str1Split = str1.substring(2);
        String str2Split = str2.substring(2);
        boolean len1 = false;
        boolean len2 = false;
        boolean found = true;
        if (str1Split.length() > 2) {
            len1 = true;
        }
        if (str2Split.length() > 2) {
            len2 = true;
        }
        if (len1 == true || len2 == true) {
            found = true;
            for (int i = 1; i < n + 1; i++) {
                String iWord = Integer.toString(i);
                if (!(str1Split.contains(iWord) || str2Split.contains(iWord))) {
                    found = false;
                    break;
                }
            }
        }
        if (found) {
            System.out.println("I become the guy.");
        } else {
            System.out.println("Oh, my keyboard!");
        }
    }
}


import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        Scanner sc = new Scanner(System.in);
        int n = Integer.valueOf(scanner.nextLine());
        Set<Integer> hashSet = new HashSet();
        int i = 0;
        while(i < 2){
            String[] arr = scanner.nextLine().split(" ");
            for(int j = 0; j < arr.length; j++){
                int number = Integer.valueOf(arr[j]);
                if(number >= 1 && number <= n){
                    hashSet.add(number);
                }
            }
            i++;
        }

        if(hashSet.size() >= n) System.out.println("I become the guy.");
        else System.out.println("Oh, my keyboard!");

    }
}


import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        Scanner sc = new Scanner(System.in);
        int n = Integer.valueOf(scanner.nextLine());
        Set<Integer> hashSet = new HashSet();
        int i = 0;
        while(i < 2){
            String[] arr = scanner.nextLine().split(" ");
            for(int j = 0; j < arr.length; j++){
                hashSet.add(Integer.valueOf(arr[j]));
            }
            i++;
        }

        if(hashSet.size() == n) System.out.println("I become the guy.");
        else System.out.println("Oh, my keyboard!");
    }
}


#include<bits/stdc++.h>

#define x first

#define y second

#define eps 1e-7

#define pb push_back

#define inf 0x3f3f3f3f

#define mod 1000000007

#define sq(x) ((x)*(x))

#define cb(x) ((x)*(x)*(x))

#define bit(x, y) (((x)>>(y))&1)

#define bctz(x) (__builtin_ctz(x))

#define bclz(x) (__builtin_clz(x))

#define bclzl(x) (__builtin_clzl(x))

#define bctzl(x) (__builtin_ctzl(x))

#define bpt(x) (__builtin_popcount(x))

#define bptl(x) (__builtin_popcountll(x))

#define pi 3.1415926535897932384626433832795

#define PQ priority_queue<pii, vector<pii>, greater<pii> >

using namespace std;

typedef double DO;

typedef long long INT;

typedef vector<int> VI;

typedef pair<int, int> pii;

typedef pair<pii, int> pi3;

template<typename T, typename U> inline void smin(T &a, U b) {if(a>b) a=b;}

template<typename T, typename U> inline void smax(T &a, U b) {if(a<b) a=b;}

template <class T> inline void gn(T &x) {char c, sg=0; while(c=getchar(), (c>'9' || c<'0') && c!='-'); for((c=='-' ? sg=1, c=getchar() : 0), x=0; c>='0' && c<='9'; c=getchar()) x=(x<<1)+(x<<3)+c-'0'; if(sg) x=-x;}

template <class T1, class T2> inline void gn(T1 &x1, T2 &x2) {gn(x1), gn(x2);}

template <class T1, class T2, class T3> inline void gn(T1 &x1, T2 &x2, T3 &x3) {gn(x1, x2), gn(x3);}

template <class T1, class T2, class T3, class T4> inline void gn(T1 &x1, T2 &x2, T3 &x3, T4 &x4) {gn(x1, x2), gn(x3, x4);}

template <class T> inline void print(T x) {if(x<0) {putchar('-'); return print(-x);} if(x<10) {putchar('0'+x); return ;} print(x/10); putchar(x%10+'0');}

template <class T> inline void println(T x) {print(x); putchar('\n');}

template <class T> inline void printsp(T x) {print(x); putchar(' ');}

template <class T1, class T2> inline void print(T1 x1, T2 x2) {printsp(x1), println(x2);}

template <class T1, class T2, class T3> inline void print(T1 x1, T2 x2, T3 x3) {printsp(x1), printsp(x2), println(x3);}

template <class T1, class T2, class T3, class T4> inline void print(T1 x1, T2 x2, T3 x3, T4 x4) {printsp(x1), printsp(x2), printsp(x3), println(x4);}

int power(int a, INT b, int m, int ans=1) {

	for(; b; b>>=1, a=1LL*a*a%m) if(b&1) ans=1LL*ans*a%m;

	return ans;

}

#define NN 100010

int n;

INT a[NN], b[NN];

INT x, N;

set<INT> s;

map<INT, int> cnt;

int main() {

#ifndef	ONLINE_JUDGE

	freopen("in.in", "r", stdin);

	freopen("out.out", "w", stdout);

#endif

	gn(n, x);

	for(int i=0; i<n; i++) {

		gn(a[i]);

		N+=a[i];

	}

	for(int i=0; i<n; i++) b[i]=N-a[i];

	sort(b, b+n);

	for(int i=0; i<n; i++) {

		INT u=b[i];

		s.insert(u);

		cnt[u]++;

		while(cnt[u]==x) {

			s.erase(u);

			cnt[u]=0;

			s.insert(++u);

			cnt[u]++;

		}

	}

	INT u=*s.begin();

	smin(u, N);

	println(power(x, u, mod));

}