


import os



def     __lowerCAmelCase						(							)       ->							Tuple:
   __lowerCamelCase:				Union[str, Any]     =	os.path.dirname(os.path.realpath(snake_case ) )
   __lowerCamelCase:				List[str]     =	os.path.join(snake_case						,      """triangle.txt""" )

   with open(snake_case ) as f:
      __lowerCamelCase:				Any     =	f.readlines()

   __lowerCamelCase:				Union[str, Any]     =	[]
   for line in triangle:
      __lowerCamelCase:				List[Any]     =	[]
      for number in line.strip().split(""" """ ):
         numbers_from_line.append(int(snake_case ) )
      a.append(snake_case )

   for i in range(1						,      len(snake_case ) ):
      for j in range(len(a[i] ) ):
         __lowerCamelCase:				int     =	a[i - 1][j] if j != len(a[i - 1] ) else 0
         __lowerCamelCase:				Any     =	a[i - 1][j - 1] if j > 0 else 0
         a[i][j] += max(snake_case						,      snake_case )
   return max(a[-1] )


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






import math



def     __lowerCAmelCase						(							snake_case	:    int )       ->							bool:
   __lowerCamelCase:				Dict     =	math.loga(math.sqrt(4 * positive_integer + 1 ) / 2 + 1 / 2 )

   return exponent == int(snake_case )



def     __lowerCAmelCase						(							snake_case	:    float = 1 / 12345 )       ->							int:
   __lowerCamelCase:				str     =	0
   __lowerCamelCase:				Optional[Any]     =	0

   __lowerCamelCase:				str     =	3
   while True:
      __lowerCamelCase:				int     =	(integer**2 - 1) / 4
      # if candidate is an integer, then there is a partition for k
      if partition_candidate == int(snake_case ):
         __lowerCamelCase:				Union[str, Any]     =	int(snake_case )
         total_partitions += 1
         if check_partition_perfect(snake_case ):
            perfect_partitions += 1
      if perfect_partitions > 0:
         if perfect_partitions / total_partitions < max_proportion:
            return int(snake_case )
      integer += 1


if __name__ == "__main__":
   print(F"""{solution() = }""")


