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

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

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(10000)


def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, A):
    ans = 0
    return ans


def main():
    N = read_int()
    if N == 1:
        print('Hello World')
    else:
        A = read_int()
        B = read_int()

        print(A + B)


if __name__ == '__main__':
    main()

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

Solution (Python):
def getN():
    return int(input())

def getMN():
    a = input().split()
    b = [int(i) for i in a]
    return b[0],b[1]

def getlist():
    a = input().split()
    b = [int(i) for i in a]
    return b

N = getN()

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

if N ==2:
    A = getN()
    B = getN()
    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:
    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 = input()
if a == '2':
    print (int(input()) + int(input()))
if a == '1':
    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):
a=input()
if a=='1':
  print("Hello World")
else:
  b=input()
  c=input()
  print(int(b)+int(c))

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

from sys import stdin

s_in = lambda: stdin.readline()[:-1] 
d_in = lambda: int(stdin.readline()) 
ds_in = lambda: list(map(int, stdin.readline().split())) 

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

if __name__ == "__main__":
    l = input()
    if int(l) == 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=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')
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):



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

Solution (Python):
import sys
stdin = sys.stdin
 
sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

n = ni()
if n == 1:
    print("Hello World")
    
else:
    a = ni()
    b = ni()
    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):
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:
    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):

import math,string,itertools,fractions,heapq,collections,re,array,bisect
import numpy as np

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

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

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")
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(raw_input())
if N==1:
    print "Hello World"
else:
    a = int(raw_input())
    b = int(raw_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)