





'''simple docstring'''



from math import factorial, radians




def 				_lowerCAmelCase  (			lowerCamelCase_     :					float						,    lowerCamelCase_     :					int = 1_8						,    lowerCamelCase_     :					int = 1_0			):
			__lowercase			  =							angle_in_degrees - ((angle_in_degrees // 3_6_0.0) * 3_6_0.0)

			# Converting from degrees to radians
			__lowercase			  =							radians(_UpperCamelCase			)

			__lowercase			  =							angle_in_radians
			__lowercase			  =							3
			__lowercase			  =							-1

			for _ in range(_UpperCamelCase			):
						result += (b * (angle_in_radians**a)) / factorial(_UpperCamelCase			)

						__lowercase			  =							-b  # One positive term and the next will be negative and so on...
						a += 2  # Increased by 2 for every term.

			return round(_UpperCamelCase						,    _UpperCamelCase			)


if __name__ == "__main__":
							__import__('''doctest''').testmod()












'''simple docstring'''



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

			while True:
						i += 1
						t_num += i

						if count_divisors(lowerCamelCase_			) > 5_0_0:
									break

			return t_num


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





