


'''simple docstring'''
from collections import defaultdict
from math import ceil, sqrt


def       _lowercase							(					UpperCamelCase__							:       Any = 1000000,					UpperCamelCase__							:       List[Any] = 10      ):
 __A	:		List[str]	  =      defaultdict(UpperCamelCase__      )

 for outer_width in range(3,					(t_limit // 4) + 2      ):
  if outer_width * outer_width > t_limit:
   __A	:		Optional[int]	  =      max(
       ceil(sqrt(outer_width * outer_width - t_limit      )      ),					1      )
  else:
   __A	:		Union[str, Any]	  =      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 <= 10      )


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







"""simple docstring"""



import os



def 	_lowerCamelCase(	a = "matrix.txt"				):
       with open(os.path.join(os.path.dirname(a				)   ,    a				)				) as in_file:
              __a       =    in_file.read()

       __a       =    [[int(a				) for cell in row.split(","				)] for row in data.strip().splitlines()]
       __a       =    [[0 for cell in row] for row in grid]
       __a       =    len(grid[0]				)

       __a       =    [[0 for i in range(a				)] for j in range(a				)]
       __a       =    grid[0][0]
       for i in range(1   ,    a				):
              __a       =    grid[0][i] + dp[0][i - 1]
       for i in range(1   ,    a				):
              __a       =    grid[i][0] + dp[i - 1][0]

       for i in range(1   ,    a				):
              for j in range(1   ,    a				):
                     __a       =    grid[i][j] + min(dp[i - 1][j]   ,    dp[i][j - 1]				)

       return dp[-1][-1]


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