output_description: If N=1, print `Hello World`; if N=2, print A+B.
  
  * * *
input_description: Input is given from Standard Input in one of the following formats:
  
      
      
      1
      
      
      
      2
      A
      B
attempt: ###############################################################################
  
  from bisect import bisect_left as binl
  from copy import copy, deepcopy
  
  
  def intin():
      input_tuple = input().split()
      if len(input_tuple) <= 1:
          return int(input_tuple[0])
      return tuple(map(int, input_tuple))
  
  
  def intina():
      return [int(i) for i in input().split()]
  
  
  def intinl(count):
      return [intin() for _ in range(count)]
  
  
  def modadd(x, y):
      global mod
      return (x + y) % mod
  
  
  def modmlt(x, y):
      global mod
      return (x * sy) % mod
  
  
  def lcm(x, y):
      while y != 0:
          z = x % y
          x = y
          y = z
      return x
  
  
  def make_linklist(xylist):
      linklist = {}
      for a, b in xylist:
          linklist.setdefault(a, [])
          linklist.setdefault(b, [])
          linklist[a].append(b)
          linklist[b].append(a)
      return linklist
  
  
  def calc_longest_distance(linklist, v=1):
      distance_list = {}
      distance_count = 0
      distance = 0
      vlist_previous = []
      vlist = [v]
      nodecount = len(linklist)
  
      while distance_count < nodecount:
          vlist_next = []
          for v in vlist:
              distance_list[v] = distance
              distance_count += 1
              vlist_next.extend(linklist[v])
          distance += 1
          vlist_to_del = vlist_previous
          vlist_previous = vlist
          vlist = list(set(vlist_next) - set(vlist_to_del))
  
      max_distance = -1
      max_v = None
      for v, distance in distance_list.items():
          if distance > max_distance:
              max_distance = distance
              max_v = v
  
      return (max_distance, max_v)
  
  
  def calc_tree_diameter(linklist, v=1):
      _, u = calc_longest_distance(linklist, v)
      distance, _ = calc_longest_distance(linklist, u)
      return distance
  
  
  ###############################################################################
  
  
  def main():
      n = intin()
  
      if n == 1:
          print("Hello World")
      else:
          a = intin()
          b = intin()
          print(a + b)
  
  
  if __name__ == "__main__":
      main()
  
problem_description: Statement
  
  In 2020, AtCoder Inc. with an annual sales of more than one billion yen (the
  currency of Japan) has started a business in programming education.  
  One day, there was an exam where a one-year-old child must write a program
  that prints `Hello World`, and a two-year-old child must write a program that
  receives integers A, B and prints A+B.  
  Takahashi, who is taking this exam, suddenly forgets his age.  
  He decides to write a program that first receives his age N (1 or 2) as input,
  then prints `Hello World` if N=1, and additionally receives integers A, B and
  prints A+B if N=2.  
  Write this program for him.
samples: [{"input": "1", "output": "Hello World\n    \n\nAs N=1, Takahashi is one year old. Thus, we should print `Hello World`.\n\n* * *"}, {"input": "2\n    3\n    5", "output": "8\n    \n\nAs N=2, Takahashi is two years old. Thus, we should print A+B, which is 8\nsince A=3 and B=5."}]