import os
import math
import numpy as np


# Find the maximum path sum of the triangle below, if you follow a path that
# starts at the top and goes down, choosing one of either value below you


#                             75
#                           95 64
#                         17 47 82
#                       18 35 87 10
#                     20 04 82 47 65
#                   19 01 23 75 03 34
#                 88 02 77 73 07 63 67
#               99 65 04 28 06 16 70 92
#             41 41 26 56 83 40 80 70 33
#           41 48 72 33 47 32 37 16 94 29
#         53 71 44 65 25 43 91 52 97 51 14
#       70 11 33 28 77 73 17 78 39 68 17 57
#     91 71 52 38 17 14 91 43 58 50 27 29 48
#   63 66 04 68 89 53 67 30 73 16 69 87 40 31
# 04 62 98 27 23 09 70 98 73 93 38 53 60 04 23


def getMaxPath(t):
	t0 = t[0][0]

	if len(t) == 1:
		return t0

	# if len(t) == 2:
	# 	return t0 + max(t[1][0], t[1][1])

	left = list(map(lambda row: row[:-1], t[1:]))
	right = list(map(lambda row: row[1:], t[1:]))

	return t0 + max(getMaxPath(left), getMaxPath(right))

def main():
	print("Hello, this is Patrick")

	triangle = '''
75
95 64
17 47 82
18 35 87 10
20 04 82 47 65
19 01 23 75 03 34
88 02 77 73 07 63 67
99 65 04 28 06 16 70 92
41 41 26 56 83 40 80 70 33
41 48 72 33 47 32 37 16 94 29
53 71 44 65 25 43 91 52 97 51 14
70 11 33 28 77 73 17 78 39 68 17 57
91 71 52 38 17 14 91 43 58 50 27 29 48
63 66 04 68 89 53 67 30 73 16 69 87 40 31
04 62 98 27 23 09 70 98 73 93 38 53 60 04 23'''

	ts = triangle.strip().split('\n')
	t = []
	for x in ts:
		t.append(list(map(lambda y: int(y), x.split(' '))))

	r = getMaxPath(t)
	print(r)


if __name__ == "__main__":
	main()