from collections import defaultdict
from math import ceil, sqrt


def     UpperCAmelCase__ (       lowerCAmelCase__  :int = 1_0_0_0_0_0_0      ,	lowerCAmelCase__  :int = 1_0	)				->					int:
      '''simple docstring'''


      lowercase														=			defaultdict(_UpperCamelCase	)

      for outer_width in range(3      ,	(t_limit // 4) + 2	):
            if outer_width * outer_width > t_limit:
                  lowercase														=			max(
                      ceil(sqrt(outer_width * outer_width - t_limit	)	)      ,	1	)
            else:
                  lowercase														=			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() = }""")




"""simple docstring"""






from __future__ import annotations


def     UpperCAmelCase__ (       lowerCAmelCase__  :list[float]      ,	lowerCAmelCase__  :list[float]	)				->					float:
      '''simple docstring'''


      lowercase														=			sorted(numsa + numsa	)
      lowercase							,							lowercase														=			divmod(len(lowerCAmelCase__	)      ,	2	)
      if mod == 1:
            return all_numbers[div]
      else:
            return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
       import doctest

       doctest.testmod()
       __lowerCAmelCase					: List[Any]        =[float(x) for x in input("""Enter the elements of first array: """).split()]
       __lowerCAmelCase					: List[Any]        =[float(x) for x in input("""Enter the elements of second array: """).split()]
       print(F"""The median of two arrays is: {median_of_two_arrays(array_a, array_a)}""")



