





"""simple docstring"""
import os






def 					A__				(			):
							A		=  os.path.dirname(os.path.realpath(UpperCamelCase       )       )
							A		=  os.path.join(UpperCamelCase					,  "triangle.txt"       )

							with open(UpperCamelCase       ) as f:
														A		=  f.readlines()

							A		=  []
							for line in triangle:
														A		=  []
														for number in line.strip().split(" "       ):
																					numbers_from_line.append(int(UpperCamelCase       )       )
														a.append(UpperCamelCase       )

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


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




from decimal import Decimal, getcontext
from math import ceil, factorial


def       A       (					lowercase )   ->  str:
		'''simple docstring'''

		if not isinstance(lowercase    ,       lowercase ):
				raise TypeError('Undefined for non-integers' )
		elif precision < 1:
				raise ValueError('Undefined for non-natural numbers' )

		UpperCamelCase		=     precision
		UpperCamelCase		=     ceil(precision / 14 )
		UpperCamelCase		=     426_880 * Decimal(10_005 ).sqrt()
		UpperCamelCase		=     1
		UpperCamelCase		=     13_591_409
		UpperCamelCase		=     Decimal(lowercase )
		for k in range(1    ,       lowercase ):
				UpperCamelCase		=     factorial(6 * k ) // (factorial(3 * k ) * factorial(lowercase ) ** 3)
				linear_term += 545_140_134
				exponential_term *= -262_537_412_640_768_000
				partial_sum += Decimal(multinomial_term * linear_term ) / exponential_term
		return str(constant_term / partial_sum )[:-1]


if __name__ == "__main__":
					_UpperCAmelCase					: Dict      =       50
					print(F'''The first {n} digits of pi is: {pi(n)}''')
