Problem:
 ﻿Score: 100 points    Problem 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.      Constraints   N is 1 or 2 .  A is an integer between 1 and 9 (inclusive).  B is an integer between 1 and 9 (inclusive).         Input  Input is given from Standard Input in one of the following formats:  1  2 A  B       Output  If N=1 , print Hello World ; if N=2 , print A+B .        Sample Input 1 1      Sample Output 1 Hello World  As N=1 , Takahashi is one year old. Thus, we should print Hello World .       Sample Input 2 2
3
5      Sample Output 2 8  As N=2 , Takahashi is two years old. Thus, we should print A+B , which is 8 since A=3 and B=5 .

Solution (Python):
N = int(input())

if N == 1:
    print("Hello World")

else:
    A = int(input())
    B = int(input())

    c = A + B

    print(c)

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
N = int(input())
if N == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
n=input()
if n=="1":
  print("Hello World")
else:
  a=int(input())
  b=int(input())
  print(a+b)

Solution (Python):
n=int(input())
if n==1:
  print('Hello World')
else:
  print(int(input())+int(input()))

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
n=int(input())

if n==1:
    print('Hello World')

elif n==2:
    a=int(input())
    b=int(input())

    print(a+b)

Solution (Python):
n = int(input())
if n==1:
  print("Hello World")
else:
  i = [int(input()) for i in range(2)]
  print(i[0]+i[1])

Solution (Python):


n = int(input())

if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
n = input()
if(n == '1'):
  print('Hello World')
else:
  a = [int(input()) for i in range(2)]
  print(sum(a))

Solution (Python):
def solve():
    n = input()
    if n == '1':
        print('Hello World')
    else:
        a = int(input())
        b = int(input())
        print(a+b)


if __name__ == '__main__':
    solve()

Solution (Python):
N = int(input())
if N == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
N = int(input())
if N == 1:
    print("Hello World")
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    print(int(input()) + int(input()))

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
N=int(input())
if N==1:
    print('Hello World')
else:
    A=int(input())
    B=int(input())
    print(int(A+B))

Solution (Python):
n = int(input())
if n ==1:print("Hello World")
else:
    a = [int(input()) for i in range(n)]
    print(sum(a))

Solution (Python):
if input() == "1":
  print("Hello World")
else:
  print(int(input())+int(input()))

Solution (Python):
def main():
    num = int(input())
    if num == 1:
        print('Hello World')
        return
    A = int(input())
    B = int(input())
    print(A+B)
main()

Solution (Python):
N = int(input())

if N == 1:
  print('Hello World')
else:
  A = int(input())
  B = int(input())
  print(A + B)

Solution (Python):
n,*l=map(int,open(0));print("Hello World" if n==1 else sum(l))

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    print(int(input()) + int(input()))

Solution (Python):
n = int(input())
if n == 2:
  a = int(input())
  b = int(input())
  print(a + b)
else:
  print('Hello World')

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip()

N = int(input())

if N == 1:
    print("Hello World")
else:
    A = int(input())
    B = int(input())    
    print(A+B)

Solution (Python):
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    N = input_number()
    if N == 1:
        print("Hello World")
        return
    else:
        A = input_number()
        B = input_number()
        print(A + B)
        return


if __name__ == '__main__':
    main()

Solution (Python):
if input()=="1":
  print("Hello World")
else:
  print(int(input())+int(input()))

Solution (Python):
f=lambda:int(input())
print(f()+f() if f()>1 else 'Hello World')

Solution (Python):
if input()=='1':
  print('Hello World')
  exit()
print(int(input())+int(input()))

Solution (Python):
N = int(input())

if N == 1:
    print('Hello World')
elif N == 2:
    A = int(input())
    B = int(input())
    print(A+B)

Solution (Python):
N = input()
if N == '2':
    A = int(input())
    B = int(input())
    print(A+B)
else:
    print('Hello World')

Solution (Python):
n = int(input())

if n == 1:
  print('Hello World')
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
N=int(input())
if N==1:
  print('Hello World')
else:
  A=int(input())
  B=int(input())
  print(A+B)

Solution (Python):
n = int(input())
print("Hello World" if n == 1 else int(input()) + int(input()))

Solution (Python):
if int(input()) == 1:
    ans = 'Hello World'
else:
    ans = sum(int(input()) for _ in range(2))
print(ans)

Solution (Python):
n = int(input())
if n==2:
  a = int(input())
  b = int(input())
  print(int(a+b))
else:
  print('Hello World')

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
elif n == 2:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
age = int(input())
 
if age == 1:
  print("Hello World")
  
else:
  A=int(input())
  B =int(input())
  print(A+B)

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

if i() == 1:
    print('Hello World')
else:
    print(i()+i())

Solution (Python):
N=int(input())
if N==1:
  print("Hello World")
  exit()
A=int(input())
B=int(input())
print(A+B)

Solution (Python):
n = input()
if n == '1':
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n ==1:
    print('Hello World')
if n ==2:
    a = int(input())
    b = int(input())
    ans = a+b
    print(ans)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n==1:
    print('Hello World')
    exit()
a = int(input())
b = int(input())
print(a+b)

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    c=0
    for i in range(2):
        c+=int(input())
    print(c)

Solution (Python):
if input() =="1":
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
if int(input()) == 1:
  print('Hello World')
else:
  print(int(input())+int(input()))

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else :
    A=int(input())
    B=int(input())
    print(str(A+B))

Solution (Python):
n = int(input())
if n == 2:
    a = int(input())
    b = int(input())
    print(a+b)
else:
    print('Hello World')

Solution (Python):
N = int(input())
if N == 1:
    print('Hello World')
elif N == 2:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
N = int(input())

if N == 1:
    print("Hello World")

elif N == 2:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
n = int(input())

if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n==1:
    print("Hello World")
if n==2:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N =int(input())

if N == 1:
    print("Hello World")

elif N == 2:
    A =int(input())
    B =int(input())
    print(A + B)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
elif n == 2:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
y = int(input())
if y == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n==1: print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
n = int(input())

if n == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
n=int(input())
if n==2:
  a=int(input())
  b=int(input())
  print(a+b)
else:
  print("Hello World")

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

n = i()
if n == 1:
	print("Hello World")
else:
	a = i()
	b = i()
	print(a+b)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
import math
def ip():return int(input())
def imp():return map(int,input().split())

n=ip()
if n==1:print("Hello World")
else:
    a=ip()
    b=ip()
    print(a+b)

Solution (Python):
N = int(input())
if N == 1:
  print('Hello World')
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
x = int(input())

if x == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    ans = a + b
    print(a+b)

Solution (Python):
N = int(input())
if N == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):






def main():
    N = int(input())

    if N == 1:
        return "Hello World"
    else:
        a = int(input())
        b = int(input())
        return a + b


print(main())

Solution (Python):
def main():
    N = int(input())
    
    if N == 1:
        print("Hello World")
    else:
        A = int(input())
        B = int(input())
        print(A+B)


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
if n==1:
    print('Hello World')
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
n = int(input())

if n == 1:
  print('Hello World')
else:
  a = int(input())
  b = int(input())
  print(a + b)

Solution (Python):
if int(input()) == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N = int(input())
if(N == 1):
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+ B)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
a=list(map(int,open(0).read().split()));print(sum(a)-2 if a[0]==2 else 'Hello World')

Solution (Python):
N = int(input())
if N==2:
    A = int(input())
    B = int(input())
    print(A+B)

elif N==1:
    print('Hello World')

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
elif n ==2:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
n = int(input())
if n==1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
k = int(input())
if k == 1: print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
N = int(input())
if N == 1:
    print("Hello World")
else:
    A = int(input())
    B = int(input())
    print(A+B)

Solution (Python):
n = int(input())

if n == 1:
	print('Hello World')
else:    
	a = int(input())
	b = int(input())

	print(a + b)

Solution (Python):
n=int(input())
if n==1:
    print('Hello World')
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
N=int(input())

if N==1:
  print('Hello World')
elif N==2:
  A=int(input())
  B=int(input())
  print(A+B)

Solution (Python):
N = int(input())
if N == 1:
    print('Hello World')
    exit()
ans = int(input()) + int(input())
print(ans)

Solution (Python):
n=int(input())

if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  print(int(input()) + int(input()))

Solution (Python):
n=int(input())
if n ==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
    exit()

a = int(input())
b = int(input())
print(a + b)

Solution (Python):
n = input()

if n == "1":
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())

if n == 1:
    print("Hello World")
else:
    l = []
    for _ in range(2):
        a = int(input())
        l.append(a)
    print(sum(l))

Solution (Python):
n = int(input())
if n == 1:
  print('Hello World')
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
N = int(input())
if N == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
n = int(input())
if n == 1:
    print ('Hello World')
else:
    a = int(input())
    b = int(input())
    print (a+b)

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    n = i_input()
    
    if n == 1:
        print('Hello World')
    else:
        a = i_input()
        b = i_input()
        print(a+b)

if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())

if x == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N = int(input())
if N == 1:
    print('Hello World')
else:
    print(int(input()) + int(input()))

Solution (Python):
N = int(input())

if N == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
N = int(input())
if N == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
N = int(input())

if N == 1:
    print("Hello World")
else:
    print(int(input()) + int(input()))

Solution (Python):
n=int(input())

if n==1:
  print("Hello World")
else:
  A=int(input())
  B=int(input())
  print(A+B)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print( a + b )

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N = int(input())
if N==1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
a = int(input())

if(a == 1):
  print("Hello World")
else:
  x = int(input())
  y = int(input())
  print(x+y)

Solution (Python):
n = int(input())
if n == 1:
  print('Hello World')
elif n == 2:
  a = int(input())
  b = int(input())
  print(a + b)

Solution (Python):
old = int(input())
if old == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
N = int(input())
if N == 1:
  print("Hello World")
else:
  A, B = [int(input()) for i in range(2)]
  print(A+B)

Solution (Python):
if input()=='1':
    print('Hello World')
else:
    result=0
    for i in range(2):
        result+=int(input())
    print(result)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
n = int(input())
if n == 2:
    ans = 0
    for i in range(2):
        ans += int(input())
    print(ans)
elif n == 1:
    print('Hello World')

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
elif n == 2:
    s = 0
    for i in range(2):
        s += int(input())
    print(s)

Solution (Python):
N = int(input())
if N == 1:
  print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N=int(input())

if(N==1):
        print('Hello World')
else:
    A=int(input())
    B=int(input())
    print(A+B)

Solution (Python):

n=int(input())
if n==1:print('Hello World')
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):

import sys
input = sys.stdin.readline









N = int(input())

if N==1:
    print("Hello World")
else:
    print(int(input()) + int(input()))

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N = int(input())
if N==1:
  print('Hello World')
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
o=int(input())
if o==1:
    print('Hello World')
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
print('Hello World' if int(input())==1 else int(input())+int(input()))

Solution (Python):
n = int(input())
if n==1:
  print('Hello World')
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
if int(input()) ==1:
  print('Hello World')
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())

if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  print(sum([int(input()) for i in range(2)]))

Solution (Python):
from collections import defaultdict
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


n = I()
if n == 1:
    print('Hello World')
else:
    a = I()
    b = I()
    print(a + b)

Solution (Python):

N = int(input())

if N == 1:
    print("Hello World")
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
if int(input())==1:
  print('Hello World')
else:
  print(int(input())+int(input()))

Solution (Python):
a=int(input())
if a==1:
    print("Hello World")
else:
    b=[int(input()) for i in range(2)]
    print(sum(b))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()


def main():
    N = int(input())
    if N == 1: print("Hello World")
    else:
        A = int(input())
        B = int(input())
        print(A + B)



if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())

if n==1:
  print('Hello World')
elif n==2:
  a=int(input())
  b=int(input())
  print(a+b)

Solution (Python):
s=input()
if s=="1":
    print("Hello World")
else:
    print(int(input())+int(input()))

Solution (Python):
N = int(input())
if N == 1:
    print("Hello World")
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
elif n == 2:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
N = int(input()) 
if N == 1:
  print("Hello World")
elif N == 2:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
x = int(input())
if x == 1:
    print("Hello World")
    exit()
if x == 2:
    y, z = [int(input()) for _ in range(2)]
    print(y + z)

Solution (Python):
def resolve():
    n=int(input())
    if n==1:
        print('Hello World')
    else:
        a=int(input())
        b=int(input())
        print(a+b)
        
    
if __name__ == '__main__':
    resolve()

Solution (Python):
n = int(input())
if n == 1:
	print("Hello World")
else:
	a = int(input())
	b = int(input())
	print(a + b)

Solution (Python):


N = int(input())
if N == 1:
    print('Hello World')
else:
    ans = 0
    for i in range(2):
        ans += int(input())
    print(ans)

Solution (Python):
n = int(input())

if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
n = int(input())

if n == 1:
    print('Hello World')

else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
def main():
    n = int(input())

    if n == 1:
        print('Hello World')
    else:
        a = int(input())
        b = int(input())

        print(a + b)

if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
import itertools
import math
import fractions
import functools
import copy

n = int(input())

if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
I=lambda:int(input());print(I()+I()if~-I()else'Hello World')

Solution (Python):
if input() == "1":
    print('Hello World')
else:
    print(int(input()) + int(input()))

Solution (Python):
*N,= map(int,open(0).read().split())
if N[0] == 1:
    print("Hello World")
if N[0] == 2:
    print(N[1] + N[2])

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N=int(input())
if N==1:
    print('Hello World')
else:
    A=int(input())
    B=int(input())
    print(A+B)

Solution (Python):
n = int(input())
if n==1:
  print('Hello World')
else:
  a=int(input())
  b=int(input())
  print(a+b)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  print(int(input()) + int(input()))

Solution (Python):
def main():
    n = int(input())
    if n == 1:
        print('Hello World')
    else:
        a = int(input())
        b = int(input())
        print(a+b)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
N = int(input())
if N == 1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


n = I()
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
from functools import reduce

print(reduce(lambda x, y: x + y, [int(input()) for i in range(2)])) if input() == '2' else print('Hello World')

Solution (Python):
n=int(input())
import sys
if n==1:
    print('Hello World')
    sys.exit()

a=int(input())
b=int(input())
print(a+b)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())

if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
N = input()

if N == '1':
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
N = int(input())
if N == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A+B)

Solution (Python):
N = input()

if N == '1':
  print('Hello World')
else:
  A = int(input())
  B = int(input())
  print(A+B)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())
if n==1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n = int(input())

if n==1:
  print("Hello World")
else:
  print(int(input())+int(input()))

Solution (Python):
n=int(input())
if n==1:
  print("Hello World")
else:
  a=int(input())
  b=int(input())
  print(a+b)

Solution (Python):
n = int(input())
if n==1:
    print('Hello World')
elif n==2:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
import sys
import math
import bisect

def main():
    if int(input()) == 1:
        print('Hello World')
    else:
        a = int(input())
        b = int(input())
        print(a + b)

if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    print(int(input())+int(input()))

Solution (Python):
age = int(input())

if age == 1:
    print('Hello World')
else:
    print(int(input()) + int(input()))

Solution (Python):
n = int(input())

if n == 1:
    ans = "Hello World"
else:
    a, b = [int(input()) for _ in range(2)]
    ans = a + b

print(ans)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
elif n == 2:
    a, b = int(input()), int(input())
    print(a + b)

Solution (Python):
n = int(input())
if n==1:
  print('Hello World')
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
def ABC_112_A():
    N = int(input())

    if N == 2:
        A = int(input())
        B = int(input())
        print(A+B)
    else:
        print('Hello World')
   

if __name__ == '__main__':

    ABC_112_A()

Solution (Python):
n=int(input())
if n==1:
	print("Hello World")
else:
	a=int(input())
	b=int(input())
	print(a+b)

Solution (Python):
import itertools
import math
import fractions
import functools
n = int(input())
if n == 1:
    print("Hello World")
if n == 2:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
N=int(input())
if N==1: print('Hello World')
else: print(int(input())+int(input()))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    if n==1:
        print('Hello World')
    else:
        a=int(input())
        b=int(input())
        print(a+b)
resolve()

Solution (Python):
N = int(input())
if N == 1:
    print('Hello World')
else:
    A = int(input())
    B = int(input())
    print(A + B)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
    exit()

a = int(input())
b = int(input())
print(a+b)

Solution (Python):
n = int(input())
if n == 1:
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
a=int(input())
if a==1:
  print('Hello World')
else:
  b=int(input())
  c=int(input())
  print(b+c)

Solution (Python):
N = int(input())
if N == 2:
    A = int(input())
    B = int(input())
    print(A+B)
else:
    print('Hello World')

Solution (Python):
N = int(input())
if N == 1:
    print("Hello World")
else:
    A = int(input())
    B = int(input())
    print(A+B)

Solution (Python):
n = int(input())
if n==1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    print(int(input())+int(input()))

Solution (Python):
n = input()
if n == "1":
    print("Hello World")
elif n == "2":
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
n=int(input())
if n==1:
    print("Hello World")
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
N = input()
if N == '1':
    print('Hello World')
else:
    a = int(input())
    b = int(input())
    print(a+b)

Solution (Python):
n=int(input())
if n==1:
    print('Hello World')
else:
    a=int(input())
    b=int(input())
    print(a+b)

Solution (Python):
n=int(input())
print("Hello World" if n%2!=0 else int(input())+int(input()))

Solution (Python):


N = int(input())




def main():
    if N == 1:
        print("Hello World")
    else:
        A = int(input())
        B = int(input())
        print(A + B)

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
if n == 1:
  print('Hello World')
else:
  print(int(input()) + int(input()))

Solution (Python):
if input()=='1':
    print('Hello World')
else:
    print(int(input())+int(input()))