class Node:
   def _init_(self, key):
    self.left = none
    self.right = none
    self.val = key
def insert(root,key):
  if root is None:
     return Node(key)
  if key<root.val:
     root.left = insert(root.left,key)
  else:
     root.right = insert(root.right,key)
  return root
def search(root,key):
  if root is None:
     return False
  if root.val == key:
     return True
  elif key<root.val:
     return search(root.left,key)
  else:
     return search(root.right,key)
n = int(input())
if n<=0:
   print("Invalid input")
else:
   values = list(map(int,input().split()))
   target = int(input())
   root = None
   for val in values:
     root = insert(root,val)
   if search(root,target):
     print("Found")
   else:
     print("Not Found")