



from collections import namedtuple

UpperCAmelCase				:							List[Any]								=namedtuple("""from_to""", """from_ to""")

UpperCAmelCase				:							List[str]								={
    "atm": from_to(1, 1),
    "pascal": from_to(0.0_000_098, 10_1325),
    "bar": from_to(0.986_923, 1.01_325),
    "kilopascal": from_to(0.00_986_923, 101.325),
    "megapascal": from_to(9.86_923, 0.101_325),
    "psi": from_to(0.068_046, 14.6_959),
    "inHg": from_to(0.0_334_211, 29.9_213),
    "torr": from_to(0.00_131_579, 760),
}



def 				_lowerCAmelCase      (_lowerCAmelCase				,		_lowerCAmelCase				,		_lowerCAmelCase):





					if from_type not in PRESSURE_CONVERSION:
										raise ValueError(
										    f"""Invalid 'from_type' value: {from_type!r}  Supported values are:\n"""
										    + ", ".join(_A))
					if to_type not in PRESSURE_CONVERSION:
										raise ValueError(
										    f"""Invalid 'to_type' value: {to_type!r}.  Supported values are:\n"""
										    + ", ".join(_A))
					return (
					    value * PRESSURE_CONVERSION[from_type].from_ * PRESSURE_CONVERSION[to_type].to
					)


if __name__ == "__main__":
	import doctest

	doctest.testmod()







from __future__ import annotations



def 				_lowerCAmelCase      (_lowerCAmelCase):
					UpperCamelCase_											=				{1}
					UpperCamelCase_											=				[1]
					for _ in range(2				,		depth + 1):
										UpperCamelCase_											=				[*previous_coefficients, 0]
										UpperCamelCase_											=				[0, *previous_coefficients]
										UpperCamelCase_											=				[]
										for x, y in zip(_lowerCAmelCase				,		_lowerCAmelCase):
															coefficients.add(x + y)
															previous_coefficients.append(x + y)
					return coefficients



def 				_lowerCAmelCase      (_lowerCAmelCase):
					UpperCamelCase_											=				set()
					for number in unique_coefficients:
										UpperCamelCase_											=				2
										UpperCamelCase_											=				number
										while divisor**2 <= copy_number:
															UpperCamelCase_											=				0
															while copy_number % divisor == 0:
																				copy_number //= divisor
																				multiplicity += 1
															if multiplicity >= 2:
																				non_squarefrees.add(_lowerCAmelCase)
																				break
															divisor += 1

					return unique_coefficients.difference(_lowerCAmelCase)



def 				_lowerCAmelCase      (_lowerCAmelCase = 51):
					UpperCamelCase_											=				get_pascal_triangle_unique_coefficients(_lowerCAmelCase)
					UpperCamelCase_											=				get_squarefrees(_lowerCAmelCase)
					return sum(_lowerCAmelCase)


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