

import os

def 							__SCREAMING_SNAKE_CASE							( )      ->				int:
				_UpperCAmelCase				:						List[Any]       						=			os.path.dirname(os.path.realpath(lowerCAmelCase       )       )
				_UpperCAmelCase				:						Tuple       						=			os.path.join(lowerCAmelCase     ,					"triangle.txt"       )

				with open(lowerCAmelCase       ) as in_file:
								_UpperCAmelCase				:						Tuple       						=			[[int(lowerCAmelCase       ) for i in line.split()] for line in in_file]

				while len(lowerCAmelCase       ) != 1:
								_UpperCAmelCase				:						Dict       						=			triangle.pop()
								_UpperCAmelCase				:						int       						=			triangle[-1]
								for j in range(len(lowerCAmelCase       ) - 1       ):
												curr_row[j] += max(last_row[j]     ,					last_row[j + 1]       )
				return triangle[0][0]


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





import math

def 							__SCREAMING_SNAKE_CASE							( lowerCAmelCase:     int       )      ->				list:
				if n <= 0:
								raise ValueError("Only positive integers have prime factors"       )
				_UpperCAmelCase				:						Union[str, Any]       						=			[]
				while n % 2 == 0:
								pf.append(2       )
								_UpperCAmelCase				:						Tuple       						=			int(n / 2       )
				for i in range(3     ,					int(math.sqrt(lowerCAmelCase       )       ) + 1     ,					2       ):
								while n % i == 0:
												pf.append(lowerCAmelCase       )
												_UpperCAmelCase				:						Optional[int]       						=			int(n / i       )
				if n > 2:
								pf.append(lowerCAmelCase       )
				return pf

def 							__SCREAMING_SNAKE_CASE							( lowerCAmelCase:     int       )      ->				int:
				if n <= 0:
								raise ValueError("Only positive numbers are accepted"       )
				_UpperCAmelCase				:						Dict       						=			1
				_UpperCAmelCase				:						str       						=			1
				while n % 2 == 0:
								temp += 1
								_UpperCAmelCase				:						List[str]       						=			int(n / 2       )
				div *= temp
				for i in range(3     ,					int(math.sqrt(lowerCAmelCase       )       ) + 1     ,					2       ):
								_UpperCAmelCase				:						Any       						=			1
								while n % i == 0:
												temp += 1
												_UpperCAmelCase				:						Any       						=			int(n / i       )
								div *= temp
				if n > 1:
								div *= 2
				return div

def 							__SCREAMING_SNAKE_CASE							( lowerCAmelCase:     int       )      ->				int:
				if n <= 0:
								raise ValueError("Only positive numbers are accepted"       )
				_UpperCAmelCase				:						Optional[Any]       						=			1
				_UpperCAmelCase				:						Union[str, Any]       						=			1
				while n % 2 == 0:
								temp += 1
								_UpperCAmelCase				:						Optional[Any]       						=			int(n / 2       )
				if temp > 1:
								s *= (2**temp - 1) / (2 - 1)
				for i in range(3     ,					int(math.sqrt(lowerCAmelCase       )       ) + 1     ,					2       ):
								_UpperCAmelCase				:						List[str]       						=			1
								while n % i == 0:
												temp += 1
												_UpperCAmelCase				:						List[Any]       						=			int(n / i       )
								if temp > 1:
												s *= (i**temp - 1) / (i - 1)
				return int(lowerCAmelCase       )

def 							__SCREAMING_SNAKE_CASE							( lowerCAmelCase:     int       )      ->				int:
				_UpperCAmelCase				:						Any       						=			n
				for x in set(prime_factors(lowerCAmelCase       )       ):
								s *= (x - 1) / x
				return int(lowerCAmelCase       )


if __name__ == "__main__":
					import doctest

					doctest.testmod()


