




"""simple docstring"""




from collections import defaultdict
from math import ceil, sqrt







def      __UpperCAmelCase     ( __UpperCamelCase = 1_00_00_00	,				__UpperCamelCase = 10	):
			__lowercase			:  Dict								=       defaultdict(_A	)

			for outer_width in range(3	,				(t_limit // 4) + 2	):
						if outer_width * outer_width > t_limit:
									__lowercase			:  Optional[Any]								=       max(
									    ceil(sqrt(outer_width * outer_width - t_limit	)	)	,				1	)
						else:
									__lowercase			:  str								=       1

						hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

						for hole_width in range(_A	,				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
from math import logaa


def 			_UpperCamelCase						(    _A = "base_exp.txt"   )     ->	int:





    """simple docstring"""

    _UpperCAmelCase        = 0
    _UpperCAmelCase        = 0
    for i, line in enumerate(open(os.path.join(os.path.dirname(_A   )       ,   _A   )   )   ):
        _UpperCAmelCase     ,_UpperCAmelCase        = list(map(_A       ,   line.split(""","""   )   )   )
        if x * logaa(_A   ) > largest:
            _UpperCAmelCase        = x * logaa(_A   )
            _UpperCAmelCase        = i + 1
    return result


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