def        UpperCamelCase_							(			lowerCAmelCase__  ):



					"""simple docstring"""

					_lowerCAmelCase			:		Dict          = 1
					_lowerCAmelCase			:		List[Any]          = 2
					while i * i <= n:
										_lowerCAmelCase			:		Union[str, 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        UpperCamelCase_							(			):



					"""simple docstring"""

					_lowerCAmelCase			:		Union[str, Any]          = 1
					_lowerCAmelCase			:		int          = 1

					while True:
										i += 1
										t_num += i

										if count_divisors(__UpperCAmelCase  ) > 5_00:
															break

					return t_num


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












'''simple docstring'''

import operator as op


def 						__magic_name__       (      __UpperCAmelCase      )						->   Dict:

					'''simple docstring'''

					snake_case_		     =							[]
					snake_case_		     =							lambda __UpperCAmelCase, __UpperCAmelCase      : int(x / y      )  # noqa: E731 integer division operation
					snake_case_		     =							{
					    '''^''': op.pow,
					    '''*''': op.mul,
					    '''/''': div,
					    '''+''': op.add,
					    '''-''': op.sub,
					}  # operators & their respective operation

					# print table header
					print('''Symbol'''.center(8      ), '''Action'''.center(12      ), '''Stack''', sep=''' | '''      )
					print('''-''' * (30 + len(__UpperCAmelCase      ))      )

					for x in post_fix:
										if x.isdigit():  # if x in digit
															stack.append(__UpperCAmelCase      )  # append x to stack
															# output in tabular format
															print(x.rjust(8      ), ('''push(''' + x + ''')''').ljust(12      ), ''','''.join(__UpperCAmelCase      ), sep=''' | '''      )
										else:
															snake_case_		     =							stack.pop()  # pop stack
															# output in tabular format
															print(''''''.rjust(8      ), ('''pop(''' + b + ''')''').ljust(12      ), ''','''.join(__UpperCAmelCase      ), sep=''' | '''      )

															snake_case_		     =							stack.pop()  # pop stack
															# output in tabular format
															print(''''''.rjust(8      ), ('''pop(''' + a + ''')''').ljust(12      ), ''','''.join(__UpperCAmelCase      ), sep=''' | '''      )

															stack.append(
															    str(opr[x](int(__UpperCAmelCase      ), int(__UpperCAmelCase      )      )      )      )  # evaluate the 2 values popped from stack & push result to stack
															# output in tabular format
															print(
															    x.rjust(8      ), ('''push(''' + a + x + b + ''')''').ljust(12      ), ''','''.join(__UpperCAmelCase      ), sep=''' | ''', )

					return int(stack[0]      )


if __name__ == "__main__":
							a    :							Any										=    input('\n\nEnter a Postfix Equation (space separated) = ').split(' ')
							print('\n\tResult = ', solve(Postfix))

