


'''simple docstring'''






def 						_A					(lowerCAmelCase__	:int		) ->	list:




     '''simple docstring'''



     _a         =				[True for i in range(n + 1		)]
     _a         =				[i - 1 for i in range(n + 1		)]
     _a         =				[]
     for i in range(2					,    n + 1		):
          if is_prime[i]:
               primes.append(lowerCAmelCase__		)
          for j in range(0					,    len(lowerCAmelCase__		)		):
               if i * primes[j] >= n:
                    break
               _a         =				False

               if i % primes[j] == 0:
                    _a         =				totients[i] * primes[j]
                    break

               _a         =				totients[i] * (primes[j] - 1)

     return totients


if __name__ == "__main__":
 import doctest

 doctest.testmod()





'''simple docstring'''






import os






def 						_A					() ->	int:




     '''simple docstring'''



     _a         =				os.path.dirname(os.path.realpath(lowerCAmelCase__		)		)
     _a         =				os.path.join(lowerCAmelCase__					,    'triangle.txt'		)

     with open(lowerCAmelCase__		) as in_file:
          _a         =				[[int(lowerCAmelCase__		) for i in line.split()] for line in in_file]

     while len(lowerCAmelCase__		) != 1:
          _a         =				triangle.pop()
          _a         =				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())

