



def 			UpperCamelCase(  __UpperCamelCase							:		float     ,__UpperCamelCase							:		int ):
		if digit_amount > 0:
				return round(number - int(__UpperCamelCase )     ,__UpperCamelCase )
		return number - int(__UpperCamelCase )


if __name__ == "__main__":
						print(decimal_isolate(1.5_3, 0))
						print(decimal_isolate(3_5.3_4_5, 1))
						print(decimal_isolate(3_5.3_4_5, 2))
						print(decimal_isolate(3_5.3_4_5, 3))
						print(decimal_isolate(-1_4.7_8_9, 3))
						print(decimal_isolate(0, 2))
						print(decimal_isolate(-1_4.1_2_3, 1))
						print(decimal_isolate(-1_4.1_2_3, 2))
						print(decimal_isolate(-1_4.1_2_3, 3))






'''simple docstring'''

def      UpperCamelCase_						(					snake_case_       :       Union[str, Any]=2_81_23      )					->     str:






 '''simple docstring'''

 __lowerCAmelCase											=						[1] * (limit + 1)

 for i in range(2						,		int(limit**0.5      ) + 1      ):
  sum_divs[i * i] += i
  for k in range(i + 1						,		limit // i + 1      ):
   sum_divs[k * i] += k + i

 __lowerCAmelCase											=						set()
 __lowerCAmelCase											=						0

 for n in range(1						,		limit + 1      ):
  if sum_divs[n] > n:
   abundants.add(snake_case_      )

  if not any((n - a in abundants) for a in abundants      ):
   res += n

 return res


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






