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. 



Sample input:
1


Sample output:
Hello World

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n=input()
if n == "1":
  print("Hello World")
else:
  a,b=[int(input()) for i in range(2)]
  print(a+b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import sys

#input = sys.stdin.readline
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)

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
import sys
N=int(input())
if N == 1:
	print("Hello World")
elif N == 2:
	a=int(input())
	b=int(input())
	print(a+b)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

Solution code:

n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
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]))

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import sys
n = int(input())
if n==1:
    print("Hello World")
    sys.exit()
a = int(input())
b = int(input())
print(a+b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC-112-A
N = int(input())
if N == 1:
    print("Hello World")
else:
    ans = 0
    for _ in range(2):
        AB = int(input())
        ans += AB
    print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
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
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
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()

Submission status: Accepted

Solution code:
# ABC 112: A – Programming Education
age = int(input())

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

Submission status: Accepted

Solution code:
def main():
  #n = int(input())
  s = input()
  #s = input().split()
  #a,b = list(map(int,input().split()))
  #a = [input() for i in range(n)]
  #a = [int(input()) for i in range(n)]
  #a = [input().split() for i in range(n)]
  #a = [list(map(int,input().split())) for i in range(n)]
  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()

Submission status: Accepted

Solution code:
if int(input())-1:print(int(input())+int(input()))
else:print("Hello World")

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

*command, = map(int, sys.stdin.read().split())
n = command[0]

def main():
    if n == 1:
        print('Hello World')
    elif n == 2:
        a = command[1]; b = command[2]
        print(a + b)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
N = int(input())


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
from collections import Counter
#template
#issueから始める

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()


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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N = int(input().strip())

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

Submission status: Accepted

Solution code:
import sys
import os

MOD = 10 ** 9 + 7


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

    N = int(sys.stdin.buffer.readline().rstrip())
    print('Hello World') if N == 1 else print(sum(int(sys.stdin.buffer.readline().rstrip()) for _ in range(2)))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# | Its_Rashid | #
n = int(input())
if n == 1 :
    print('Hello World')
else :
    print(sum([int(input()) for i in range(2)]))

Submission status: Accepted

Solution code:
# | Its_Rashid | #
n = int(input())
if n == 1 :
    print('Hello World')
else :
    a = int(input())
    b = int(input())
    print(a + b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if n == 2:
        a = int(input())
        b = int(input())
        ans = a + b
    else:
        ans = "Hello World"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
if x==1:
	print('Hello World')
else:
	y=int(input())
	z=int(input())
	print(y+z)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Programming Education
n=int(input())
if n==1:
    print("Hello World")
    exit()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding:utf-8 -*-

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

if __name__=='__main__':
  main()

Submission status: Accepted

Solution code:
# import bisect
# from collections import Counter, defaultdict, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
# import math

import sys

# import numpy as np

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N==1:
    print('Hello World')
else:
    AB = [int(input()) for i in range(2)]
    print(sum(AB))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if N == 1:
    print("Hello World")
else:
    l = [int(input()) for _  in range(2)]
    print(l[0]+l[1])

Submission status: Accepted

Solution code:
n = int(input())

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

a, b = [int(input()) for _ in range(2)]

print(a + b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = int(input().strip())

if n ==1:
  print("Hello World")
else:
  A,B = [int(input().strip()) for _ in range(2)]
  print(A+B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N == 1:
  print('Hello World')
else:
  A, B = (int(input()) for i in range(2))
  print(A + B)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
switch = int(input())

if switch == 1:
    print('Hello World')
elif switch == 2:
    a1 = int(input())
    a2 = int(input())
    print(a1+a2)

Submission status: Accepted

Solution code:
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
ns = lambda: stdin.readline().rstrip()
nsn = lambda y: [ns() for _ in range(y)]
ncl = lambda y: [list(ns()) for _ in range(y)]
nas = lambda: stdin.readline().split()

n = ni()
if n == 1:
    print("Hello World")
else:
    a, b = nin(2)
    print(a + b)