
'''simple docstring'''

def 	A  (   UpperCamelCase_       :  str   )       ->							int:







			'''simple docstring'''



			lowerCAmelCase__										=				1
			lowerCAmelCase__										=				2
			while i * i <= n:
						lowerCAmelCase__										=				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  (   )       ->							List[Any]:







			'''simple docstring'''



			lowerCAmelCase__										=				1
			lowerCAmelCase__										=				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"""




from __future__ import annotations

import math



def 							_lowerCamelCase			(			__a     ):

		if num <= 0:
				SCREAMING_SNAKE_CASE_    			=			F'{num}: Invalid input, please enter a positive integer.'
				raise ValueError(__a     )

		SCREAMING_SNAKE_CASE_    			=			[True] * (num + 1)
		SCREAMING_SNAKE_CASE_    			=			[]
		SCREAMING_SNAKE_CASE_    			=			2
		SCREAMING_SNAKE_CASE_    			=			int(math.sqrt(__a     )     )

		while start <= end:
				# If start is a prime
				if sieve[start] is True:
						prime.append(__a     )

						# Set multiples of start be False
						for i in range(start * start,				num + 1,				__a     ):
								if sieve[i] is True:
										SCREAMING_SNAKE_CASE_    			=			False

				start += 1

		for j in range(end + 1,				num + 1     ):
				if sieve[j] is True:
						prime.append(__a     )

		return prime


if __name__ == "__main__":
						print(prime_sieve(int(input('Enter a positive integer: ').strip())))