


'''simple docstring'''




def 				a_							(    lowercase				,    lowercase     )      ->int:






				'''simple docstring'''

				if a < b:
								return gcd(lowercase				,    lowercase     )
				if a % b == 0:
								return b
				return gcd(lowercase				,    a % b     )





def 				a_							(    lowercase				,    lowercase				,    lowercase     )      ->int:






				'''simple docstring'''

				if y == 0:
								return 1
				__lowerCamelCase		:   Dict           =       power(lowercase				,    y // 2				,    lowercase     ) % mod
				__lowerCamelCase		:   List[Any]           =       (temp * temp) % mod
				if y % 2 == 1:
								__lowerCamelCase		:   List[Any]           =       (temp * x) % mod
				return temp





def 				a_							(    lowercase     )      ->bool:






				'''simple docstring'''

				__lowerCamelCase		:   Dict           =       2
				while b < n:
								if gcd(lowercase				,    lowercase     ) == 1 and power(lowercase				,    n - 1				,    lowercase     ) != 1:
												return False
								b += 1
				return True


if __name__ == "__main__":
				__lowercase	:   str   		=					int(input("""Enter number: """).strip())
				if is_carmichael_number(number):
								print(f"{number} is a Carmichael Number.")
				else:
								print(f"{number} is not a Carmichael Number.")









'''simple docstring'''




import os





def 				a_							(    )      ->int:






				'''simple docstring'''

				__lowerCamelCase		:   Dict           =       os.path.dirname(os.path.realpath(lowercase     )     )
				__lowerCamelCase		:   Any           =       os.path.join(lowercase				,    "triangle.txt"     )

				with open(lowercase     ) as in_file:
								__lowerCamelCase		:   List[str]           =       [[int(lowercase     ) for i in line.split()] for line in in_file]

				while len(lowercase     ) != 1:
								__lowerCamelCase		:   List[str]           =       triangle.pop()
								__lowerCamelCase		:   Union[str, Any]           =       triangle[-1]
								for j in range(len(lowercase     ) - 1     ):
												curr_row[j] += max(last_row[j]				,    last_row[j + 1]     )
				return triangle[0][0]


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





