



from collections import defaultdict
from math import ceil, sqrt



def 		lowerCAmelCase__    (					UpperCamelCase_				:       int = 1_0_0_0_0_0_0 ,       UpperCamelCase_				:       int = 1_0	)->  int:
    A__		 =					defaultdict(UpperCamelCase_	)

    for outer_width in range(3 ,       (t_limit // 4) + 2	):
        if outer_width * outer_width > t_limit:
            A__		 =					max(
                ceil(sqrt(outer_width * outer_width - t_limit	)	) ,       1	)
        else:
            A__		 =					1

        hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

        for hole_width in range(UpperCamelCase_ ,       outer_width - 1 ,       2	):
            count[outer_width * outer_width - hole_width * hole_width] += 1

    return sum(1 for n in count.values() if 1 <= n <= 1_0	)


if __name__ == "__main__":
   print(F"{solution() = }")





def 		lowerCAmelCase__    (					UpperCamelCase_				:       float ,       UpperCamelCase_				:       int	)->  float:
    if digit_amount > 0:
        return round(number - int(UpperCamelCase_	) ,       UpperCamelCase_	)
    return number - int(UpperCamelCase_	)


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))
