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:
import sys, re
from math import ceil, floor, sqrt, pi, factorial#, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

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

if __name__ == '__main__':
    main()

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

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

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

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

Submission status: Accepted

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

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:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys


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


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

Submission status: Accepted

Solution code:
# input
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:
  print(int(input())+int(input()))

Submission status: Accepted

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

Submission status: Accepted

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


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



if __name__ == "__main__":
    main()

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

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")
elif 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")
    exit()
if x == 2:
    y, z = [int(input()) for _ in range(2)]
    print(y + z)

Submission status: Accepted

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

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 - Programming Education

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

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

        print(a + b)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
import copy

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
*N,= map(int,open(0).read().split())
if N[0] == 1:
    print("Hello World")
if N[0] == 2:
    print(N[1] + N[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:
n = int(input())
if n == 1:
  print("Hello World")
else:
  print(int(input()) + int(input()))

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

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

Submission status: Accepted

Solution code:
from functools import reduce

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

Submission status: Accepted

Solution code:
n=int(input())
import sys
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 == 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')
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")
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:
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
import math
import bisect

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

if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':

    ABC_112_A()

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 math
import fractions
import functools
n = int(input())
if n == 1:
    print("Hello World")
if n == 2:
    a = int(input())
    b = int(input())
    print(a+b)

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 sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

N = int(input())
# S = input()
# N, K = map(int, input().split())
# A = list(map(int, input().split()))

def main():
    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')
else:
  print(int(input()) + int(input()))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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,*p=map(int,open(0));print('Hello World'if n==1 else sum(p))

Submission status: Accepted

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


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

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

Submission status: Accepted

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

N = int(input())

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

Submission status: Accepted

Solution code:
# ABC112A

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

Submission status: Accepted

Solution code:


w = int(input())

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

Submission status: Accepted

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

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/env python3
if input() == "1": print("Hello World"); exit()
else: print(int(input()) + int(input()))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
if s == "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")
    exit()
else:
    a = int(input())
    b = int(input())
    print(a+b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
age = int(input())
if age == 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:
  a=int(input())
  b=int(input())
  print(a+b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# AtCoder
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")
if n==2:
  a=int(input())
  print(int(input())+a)

Submission status: Accepted

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

Submission status: Accepted

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

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:
# coding: utf-8
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)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

# import sys
# input = sys.stdin.readline
# 
# sys.setrecursionlimit(10 ** 7)
# 
# (int(x)-1 for x in input().split())
# rstrip()
#
# def binary_search(*, ok, ng, func):
#     while abs(ok - ng) > 1:
#         mid = (ok + ng) // 2
#         if func(mid):
#             ok = mid
#         else:
#             ng = mid
#     return ok

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
# https://atcoder.jp/contests/abc112/tasks/abc112_a

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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
# sys.setrecursionlimit(10 ** 6)
# MOD = 10 ** 9 + 7
# 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:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
#from itertools import combinations # (string,3) 3回
#from collections import deque
#import collections.defaultdict
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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