



'''simple docstring'''
def A__       (	UpperCAmelCase_				):
						_UpperCamelCase   :						Dict												=  1
						_UpperCamelCase   :						Any												=  2
						while i * i <= n:
												_UpperCamelCase   :						List[Any]												=  0
												while n % i == 0:
																		n //= i
																		multiplicity += 1
												n_divisors *= multiplicity + 1
												i += 1
						if n > 1:
												n_divisors *= 2
						return n_divisors






def A__       (	):
						_UpperCamelCase   :						Union[str, Any]												=  1
						_UpperCamelCase   :						Tuple												=  1

						while True:
												i += 1
												t_num += i

												if count_divisors(UpperCAmelCase_				) > 5_0_0:
																		break

						return t_num


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







'''simple docstring'''
def A__       (	UpperCAmelCase_    ,    UpperCAmelCase_				):
						return int((input_a, input_a).count(0				) != 0				)






def A__       (	):
						assert nand_gate(0    ,    0				) == 1
						assert nand_gate(0    ,    1				) == 1
						assert nand_gate(1    ,    0				) == 1
						assert nand_gate(1    ,    1				) == 0


if __name__ == "__main__":
					print(nand_gate(0, 0))
					print(nand_gate(0, 1))
					print(nand_gate(1, 0))
					print(nand_gate(1, 1))


