


from collections import defaultdict
from math import ceil, sqrt






def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE = 100_0000      ,      SCREAMING_SNAKE_CASE = 10      )->						int:




      """simple docstring"""

      snake_case_ =   defaultdict(SCREAMING_SNAKE_CASE      )

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

            hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

            for hole_width in range(SCREAMING_SNAKE_CASE      ,      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 <= 10      )


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



def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE      ,      SCREAMING_SNAKE_CASE      )->						int:




      """simple docstring"""

      return int((input_a, input_a).count(0      ) == 0      )






def  __lowerCAmelCase					()->						None:




      """simple docstring"""

      assert and_gate(0      ,      0      ) == 0
      assert and_gate(0      ,      1      ) == 0
      assert and_gate(1      ,      0      ) == 0
      assert and_gate(1      ,      1      ) == 1


if __name__ == "__main__":
   test_and_gate()
   print(and_gate(1, 0))
   print(and_gate(0, 0))
   print(and_gate(0, 1))
   print(and_gate(1, 1))