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):
if input()=="1":
    print("Hello World")
else:
    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):
age = int(input())
if age == 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 _ in range(2)]
    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")
  exit()
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 _ in range(2))
    print(a+b)

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


if __name__ == '__main__':
    solve()

Solution (Python):
age = int(input())
if age == 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
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): 
    return a/gcd(a,b)*b

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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

Solution (Python):
def main():
    from sys import stdin
    
    n = int(stdin.readline()[:-1])   
    
    

    if n == 1:
        print('Hello World')
    else:
        r = [int(stdin.readline()) for i in range(n)]
        print(r[0] + r[1])
   
if __name__ == '__main__':
    main()

Solution (Python):
if int(input())==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:
  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):
print('Hello World' if input() == '1' else sum([int(input()) for i in range(2)]))

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

else:
  print(sum([int(input()) for i in range(2)]))

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

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

else:
  print(sum([int(input()) for i in range(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):
import sys

n = int(sys.stdin.readline().rstrip())
if n == 2:
    a, b = map(int, sys.stdin.read().split())

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

if __name__ == '__main__':
    ans = main()
    print(ans)

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

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

    else:
        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 = int(input())
if n == 1:
    print("Hello World")
elif n == 2:
    a = int(input())
    b = int(input())
    ans = a + b
    print(ans)

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:
    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=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):
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):
print('Hello World' if input()=='1' else 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):
import sys
input = sys.stdin.readline
N = int(input())
if N == 1 :
    print("Hello World")
else :
    sum = 0
    for i in range(2) :
        a = int(input())
        sum+=a
    print(sum)

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):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



N = int(sys.stdin.buffer.readline())
if N == 1:
    print('Hello World')
else:   
    a, b = [int(sys.stdin.buffer.readline()) for _ in range(2)]
    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):
import sys
l=[]
for i in sys.stdin:
  l.append(int(i))
print("Hello World" if l[0]==1 else l[1]+l[2])

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):
N = int(input())

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    if n==1:
        print('Hello World')
    else:
        a=INT()
        b=INT()
        print(a+b)
if __name__ == '__main__':
    do()

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:
    ans = "Hello World"
else:
    a = int(input())
    b = int(input())
    ans = a+b

print(ans)

Solution (Python):
import math
import collections
import itertools
import sys
import bisect
from heapq import heappop,heappush,heapify
sys.setrecursionlimit(10**6)
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n = INT()

if n==1:
    print("Hello World")
    exit()
a = INT()
b = INT()
print(a+b)

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

Solution (Python):
a = int(input())
if a == 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:
    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:
  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()) for _ in range(2)]

    print(sum(a))

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')
else:
  print(sum([int(input()) for i in range(2)]))

Solution (Python):
n = int(input())
l = [int(input()) for i in range(2) if n == 2]

if n == 1:
  print('Hello World')
else:
  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:
    tmp = 0
    for i in range(2):
        tmp += int(input())
    print(tmp)

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):
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:
    x = [int(input()) for i in range(2)]
    print(sum(x))

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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

Solution (Python):
def examA():
    N = I()
    if N==1:
        ans = "Hello World"
    elif N==2:
        A = I(); B = I()
        ans = A + B
    try:
        print(ans)
    except:
        print()
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examA()

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
import numpy as np
input = sys.stdin.readline
N = int(input())
if N == 2:
    A = []
    for _ in range(2):
        A.append(int(input()))
    print(sum(A))
else:
    print("Hello World")

Solution (Python):
N=int(input())
if N==1:
  print('Hello World')
else:
  b=int(input())
  c=int(input())
  print(b+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")
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:
	print(int(input())+int(input()))

Solution (Python):
n=int(input())
if n==1:
  print("Hello World")
else:
  print(sum([int(input()), int(input())]))

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

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

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):
n = int(input())
if n == 1:
    print("Hello World")
else:
    a = [int(input()) for _ in range(2)]
    print(sum(a))

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):
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
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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):
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(a+b)

Solution (Python):

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd



def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


show_flg = False



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):
n = int(input())

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

print(a+b)

Solution (Python):
x=int(input())
if(x==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):
N = int(input())
  
if N==1:
  print('Hello World')
 
elif N==2:
  A,B = [int(input()) for i in range(2)]
  print(A+B)

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

elif N==2:
  s = [int(input()) for i in range(2)]
  print(s[0]+s[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):

import math






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:
    a, b = [int(input()) for _ in range(2)]
    print(a + b)

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


if __name__ == '__main__':
    main()

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")

if n == 2:
    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):
a=int(input())
if a==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):
age = int(input())
if age == 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):
a = int(input())
if a == 1:
    print("Hello World")
    exit()
else:
    b = int(input())
    c = int(input())
    print(b+c)

Solution (Python):
n = int(input())
if n == 1:
  print("Hello World")
else:
  a = input()
  b = input()
  print(int(a) + int(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(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")
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, *t = map(int, open(0))
if n == 1:
    print("Hello World")
else:
    print(sum(t))

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):
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())
    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")
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):
x = int(input())

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

Solution (Python):
import sys
list = list(map(int, sys.stdin))
if list[0] == 1 :
    print("Hello World")
else :
    print(list[1] + list[2])

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')
elif N == 2:
  A = int(input())
  B = int(input())
  S = A + B
  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):
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 ==2:
    A = int(input())
    B = int(input())
    print(A+B)
else:
    print("Hello World")

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



  
print(ret)

Solution (Python):

import sys










def main():
    n = int(sys.stdin.readline().rstrip())
    if n == 1:
        print('Hello World')
        sys.exit()
    else:
        a, b = (int(x) for x in sys.stdin.read().split())
        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):
if input() == "1":
    print("Hello World")
else:
    print(int(input())+int(input()))

Solution (Python):
from sys import stdin
import bisect

n = int(stdin.readline().rstrip())

if n == 1:
    print("Hello World")
    exit()

li = [int(stdin.readline().rstrip()) for _ in range(n)]

print(sum(li))

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)

main()

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")
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(int(A+B))

Solution (Python):

n = 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,b = [int(input()) for i in range(n)]
    print(a+b)

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

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(a+b)

Solution (Python):
n = int(input())
if n == 1:
	print("Hello World")
elif n == 2:
	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:
    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):
b = int(input()) == 1
if (b): print('Hello World')
else: print(int(input())+int(input()))

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')
else:
    A=int(input())
    B=int(input())
    print(A+B)

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]
n=int(input())
if n==1:
    print("Hello World")
    quit()
a=int(input())
b=int(input())
print(a+b)