


import math






def   _lowercase(					__a				:						int     ):
							a__      =[True] * n
							a__      =False
							a__      =False
							a__      =True

							for i in range(3    ,     int(n**0.5 + 1     )    ,     2     ):
														a__      =i * 2
														while index < n:
																					a__      =False
																					a__      =index + i

							a__      =[2]

							for i in range(3    ,     __a    ,     2     ):
														if is_prime[i]:
																					primes.append(__a     )

							return primes






def   _lowercase(					__a				:						int = 9999_6666_3333     ):
							a__      =math.floor(math.sqrt(__a     )     ) + 100
							a__      =prime_sieve(__a     )

							a__      =0
							a__      =0
							a__      =primes[prime_index]

							while (last_prime**2) <= limit:
														a__      =primes[prime_index + 1]

														a__      =last_prime**2
														a__      =next_prime**2

														# Get numbers divisible by lps(current)
														a__      =lower_bound + last_prime
														while upper_bound > current <= limit:
																					matches_sum += current
																					current += last_prime

														# Reset the upper_bound
														while (upper_bound - next_prime) > limit:
																					upper_bound -= next_prime

														# Add the numbers divisible by ups(current)
														a__      =upper_bound - next_prime
														while current > lower_bound:
																					matches_sum += current
																					current -= next_prime

														# Remove the numbers divisible by both ups and lps
														a__      =0
														while upper_bound > current <= limit:
																					if current <= lower_bound:
																												# Increment the current number
																												current += last_prime * next_prime
																												continue

																					if current > limit:
																												break

																					# Remove twice since it was added by both ups and lps
																					matches_sum -= current * 2

																					# Increment the current number
																					current += last_prime * next_prime

														# Setup for next pair
														a__      =next_prime
														prime_index += 1

							return matches_sum


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




"""simple docstring"""

def       SCREAMING_SNAKE_CASE							( lowercase__					,					lowercase__   )			->						float:
 if digit_amount > 0:
  return round(number - int(lowercase__   )					,					lowercase__   )
 return number - int(lowercase__   )


if __name__ == "__main__":
    print(decimal_isolate(1.53, 0))
    print(decimal_isolate(35.345, 1))
    print(decimal_isolate(35.345, 2))
    print(decimal_isolate(35.345, 3))
    print(decimal_isolate(-14.789, 3))
    print(decimal_isolate(0, 2))
    print(decimal_isolate(-14.123, 1))
    print(decimal_isolate(-14.123, 2))
    print(decimal_isolate(-14.123, 3))






