

import os







def 		_lowercase (     ):
      __lowerCAmelCase					:						int					=					os.path.dirname(os.path.realpath(lowercase__						)						)
      __lowerCAmelCase					:						int					=					os.path.join(lowercase__   ,	'''triangle.txt'''						)

      with open(lowercase__						) as f:
            __lowerCAmelCase					:						Tuple					=					f.readlines()

      __lowerCAmelCase					:						List[Any]					=					[]
      for line in triangle:
            __lowerCAmelCase					:						Union[str, Any]					=					[]
            for number in line.strip().split(''' '''						):
                  numbers_from_line.append(int(lowercase__						)						)
            a.append(lowercase__						)

      for i in range(1   ,	len(lowercase__						)						):
            for j in range(len(a[i]						)						):
                  __lowerCAmelCase					:						Union[str, Any]					=					a[i - 1][j] if j != len(a[i - 1]						) else 0
                  __lowerCAmelCase					:						Optional[int]					=					a[i - 1][j - 1] if j > 0 else 0
                  a[i][j] += max(lowercase__   ,	lowercase__						)
      return max(a[-1]						)


if __name__ == "__main__":
 print(solution())





def 		_lowercase (     lowercase__ = 2_0_0						):
      __lowerCAmelCase					:						Union[str, Any]					=					[1, 2, 5, 1_0, 2_0, 5_0, 1_0_0, 2_0_0]
      __lowerCAmelCase					:						Dict					=					[0] * (pence + 1)
      __lowerCAmelCase					:						Optional[int]					=					1  # base case: 1 way to make 0 pence

      for coin in coins:
            for i in range(lowercase__   ,	pence + 1   ,	1						):
                  number_of_ways[i] += number_of_ways[i - coin]
      return number_of_ways[pence]


if __name__ == "__main__":
 assert solution(200) == 7_3682


