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:
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.py
# https://atcoder.jp/contests/abc112/tasks/abc112_a

# ★ RE:2
# in4.txt
# s1.txt

# A - Programming Education /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点: 100点

# 問題文
# 2020年, AtCoder 社は年商 10 億円を超え, プログラミング教育にも手を出すようになった.
# ある日行われたテストでは, 1 才児は Hello World を出力するプログラムを, 2 才児は整数 A, B を入力して A+B を出力するプログラムを書かなければならない.
# 高橋君はこのテストを受けているが, 突然自分が何才なのかが分からなくなってしまった.
# そこで, 最初に自分の年齢 N (N は 1 または 2) を入力し, N=1 ならば Hello World と出力し, N=2 ならば A, B を入力して A+Bを出力するプログラムを作ることにした.
# 高橋君に代わって, このようなプログラムを作りなさい.

# 制約
#     Nは 1 または 2
#     Aは 1 以上 9以下の整数
#     Bは 1 以上 9以下の整数

# 入力
# 入力は以下の 2 つのうちいずれかの形式で標準入力から与えられる.
# 1

# 2
# A
# B


# 出力
# N=1のとき, Hello World と出力し, N=2 のとき, A+Bを出力しなさい.

# 入力例 1
# 1

# 出力例 1
# Hello World

# N=1なので, 高橋君は 1才である. したがって, Hello World を出力する.

# 入力例 2
# 2
# 3
# 5

# 出力例 2
# 8

# N=2なので, 高橋君は 2 才である. A=3,B=5 なので, A+B である 8 を出力する. 


global FLAG_LOG
FLAG_LOG = False


def log(value):
    return
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    n = int(lines[0])
    # values = list(map(int, lines[1].split()))
    # n = lines[0]

    if n == 1:
        return ['Hello World']
    else:
        A = int(lines[1])
        B = int(lines[2])
        return [A+B]


# 引数を取得
def get_input_lines():
    line = input()
    N = int(line)
    # N, M = list(map(int, line.split()))
    lines = list()
    lines.append(line)
    if N == 2:
        for _ in range(2):
            lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['1']
        lines_export = ['Hello World']
    if pattern == 2:
        lines_input = ['2', '3', '5']
        lines_export = [8]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines()
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
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:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = I()
    if N == 1:
        print('Hello World')
    else:
        A = I()
        B = I()
        print(A + B)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = int(readline())
if n == 1:
    print('Hello World')
else:
    print(sum(list(map(int, read().split()))))

Submission status: Accepted

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

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

elif age == 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 == 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')

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())
  ans =A+B
  print(ans)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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
#input = sys.stdin.readline  #文字列では使わない
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:
if input() == '1':
    print('Hello World')
else:
    print(int(input()) + int(input()))

Submission status: Accepted

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

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

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:
a = 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')
    exit()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

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:
   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:
print("Hello World" if int(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:
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")
  exit()
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)
main()

Submission status: Accepted

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

Submission status: Accepted

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


solve()

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions  import gcd
#input=sys.stdin.readline
import bisect
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:
  x = int(input())
  y = int(input())
  print(x + y)

Submission status: Accepted

Solution code:
import sys
l=[]
for i in sys.stdin:
  l.append(int(i))
if l[0]==1:
  print("Hello World")
else:
  print(l[1]+l[2])

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

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

Submission status: Accepted

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


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
import sys
N = int(input())
if not (N == 1 or N == 2):
    sys.exit()

if N == 1:
    print('Hello World')  
elif N == 2:
    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")
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 = list([input() for i in range(2)])
    print(int(a[0])+int(a[1]))

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(eval(input()+'+'+input()))

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

ri = lambda: int(sys.stdin.readline())

if ri() == 1:
  print('Hello World')
  exit()
else:
  print(ri()+ri())

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.buffer.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.buffer.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

if ri() == 1:
  print('Hello World')
  exit()
else:
  print(ri()+ri())

Submission status: Accepted

Solution code:
n,*t=map(int,open(0))
print(n%2*'Hello World'or sum(t))

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:
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:
  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,b = map(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:
    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:
x=int(input())
if x==1:
    print('Hello World')
else:
    l=[int(input()) for i in range(2)]
    print(l[0]+l[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 == 2:
  a = int(input())
  b = int(input())
  print(a + b)
else:
  print('Hello World')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)

n = int(input())

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

    c = A + B

    print(c)

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

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:
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()) for i in range(2)]
  print(sum(a))

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    num = int(input())
    if num == 1:
        print('Hello World')
        return
    A = int(input())
    B = int(input())
    print(A+B)
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,*l=map(int,open(0));print("Hello World" if n==1 else sum(l))

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if input()=='1':
  print('Hello World')
  exit()
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 == '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())
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:
if int(input()) == 1:
    ans = 'Hello World'
else:
    ans = sum(int(input()) for _ in range(2))
print(ans)

Submission status: Accepted

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

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:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

if i() == 1:
    print('Hello World')
else:
    print(i()+i())

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

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:
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(str(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')
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:
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")

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

Submission status: Accepted

Solution code:
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

Submission status: Accepted

Solution code:
import math
def ip():return int(input())
def imp():return map(int,input().split())

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8

# https://atcoder.jp/contests/abc112
# 11:45-


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

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


print(main())

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:
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=list(map(int,open(0).read().split()));print(sum(a)-2 if a[0]==2 else 'Hello World')

Submission status: Accepted

Solution code:
N = int(input())
if N==2:
    A = int(input())
    B = int(input())
    print(A+B)

elif N==1:
    print('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())
    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:
k = int(input())
if k == 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')
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()
ans = int(input()) + 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:
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')
    exit()

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:
    l = []
    for _ in range(2):
        a = int(input())
        l.append(a)
    print(sum(l))

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)