import itertools

import fractions

def main():

  n = int(eval(input()))

  if n == 1:

    print('Hello World')

  else:

    a = int(eval(input()))

    b = int(eval(input()))

    print((a+b))

if __name__ == '__main__':

  main()
#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 eval(input()) == '1':

        print('Hello World')

    else:

        a = int(eval(input()))

        b = int(eval(input()))

        print((a+b))

if __name__ == '__main__':

  main()

import itertools
import fractions


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


if __name__ == "__main__":
    main()

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


if __name__ == "__main__":
    main()

-import itertools -import fractions +# 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())) -    n = int(eval(input())) -    if n == 1: +    if eval(input()) == "1":