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")
elif n == 2:
    a = int(input())
    b = int(input())
    print(a + b)

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

A = input()

if A == "1":
    print("Hello World")
else:
    X = int(input())
    Y = int(input())
    print(X + Y)

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

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

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


w = int(input())

if w == 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):
n=int(input())
if n==1:
    ans='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):

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

Solution (Python):

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

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

Solution (Python):
Nennrei = int(input())
if Nennrei == 2:
	print(int(input())+int(input()))
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):
if input()=='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()) for i in range(2))
    print(sum(x))

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('Hello World' if N==1 else A+B)

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

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

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

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

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

Solution (Python):

n = int(input())
if n == 1:
    print('Hello World')
    exit()
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())
  print(int(input())+a)

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

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

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N = ir()
if N == 1:
    print('Hello World'); exit()
A = ir(); B = ir()
answer = A + B
print(answer)

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


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):
print(int(input()) + int(input()) if int(input()) == 2 else "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())
    add = A + B
    print(add)

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, b = [int(input()) 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):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

A = INT()
B = INT()
print(A+B)

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

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

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):
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:
        num = [int(input()) for i in range(2)]
        print(num[0]+num[1])
if __name__ == "__main__":
    main()

Solution (Python):
N=int(input())
ans=0
if N==2:
    ans=list(int(input()) for i in range(2))
    print(sum(ans))
else:
    print("Hello World")

Solution (Python):
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) 
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    


MOD = 10**9 + 7
INF = 2**31  

from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  


print('Hello World' if 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 == 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")
    exit()

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

Solution (Python):
def main():
    n = input()
    if n == "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")
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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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:
    num = [int(input()) for _ in range(2)]
    print(num[0]+num[1])

Solution (Python):
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations
from math import pi, ceil, floor
import numpy as np
from collections import defaultdict, deque
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input = sys.stdin.readline





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 sys
sys.setrecursionlimit(10000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def main():
    if 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')
  exit()
else:
  a = int(input())
  b = int(input())
  print(a+b)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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):
def resolve():
  n = int(input())
  if n == 1:
    print('Hello World')
  else:
    a = int(input())
    b = int(input())
    print(a + b)
  return

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):
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 sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

n = int(readline())
if n == 1:
    print('Hello World')
else:
    a, b = map(int, read().split())
    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):
num = int(input())
if num == 2:
    A = int(input())
    B = int(input())
    print(A+B)
else:
    print('Hello World')

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

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

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

Solution (Python):
from collections import Counter


def solve():

    N = int(input())

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


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):
if int(input())==1:
	print('Hello World')
else:
	print(int(input())+int(input()))

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

Solution (Python):
icase=0
if icase==0:
    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):
import math
import collections
import sys


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]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):
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

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 sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
debugmode = True

tmp = INT()
if tmp == 2:
    a = INT()
    b = INT()
    print(a + b)
else:
    print('Hello World')

Solution (Python):
import sys
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):

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,B=(input().split() for i in range(2));print(int(A[0])+int(B[0]))

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

Solution (Python):
def Programming_Education():

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

def main():
    print(Programming_Education())

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 sys
n = int(input())
if n==1:
    print("Hello World")
    sys.exit()
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')
if 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):
if 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):
x=int(input())
if x == 1:
  print("Hello World")
elif x == 2:
  A=int(input())
  B = int(input())
  print(A+B)

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

if N == 1:
    print('Hello World')
if N == 2:
    res = 0
    for _ in range(2):
        res += int(input())
    print(res)

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:
	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:
    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
L = list()
for e in map(int, sys.stdin):
    L.append(e)
if len(L) == 1:
    print('Hello World')
else:
    print(L[1]+L[2])

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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


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):
print("Hello World" if 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 == 1:
    print("Hello World")
else:
    ans = 0
    for _ in range(2):
        AB = int(input())
        ans += AB
    print(ans)

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

if age == 1:
  print('Hello World')
elif age == 2:
  print(int(input().rstrip()) + int(input().rstrip()))

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

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

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

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

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())
  b = int(input())
  print(a+b)

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

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 deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

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

age = int(input())

if age == 1:
    print('Hello World')
elif age == 2:
    a, b = [int(input()) for _ in range(2)]
    print(a + b)

Solution (Python):
def main():
  
  s = input()
  
  
  
  
  
  
  ans = 0
  count = 0
  lis = []
  
  if s == "1":
    print("Hello World")
  elif s == "2":
    a = int(input())
    b = int(input())
    print(a+b)

if __name__ == '__main__':
  main()

Solution (Python):
if int(input())-1:print(int(input())+int(input()))
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):
import itertools
import fractions
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()