






def 							A     (       a_ = 1_000_000					)     ->						int:
					__UpperCamelCase      :					List[Any]       		=limit + 1
					__UpperCamelCase      :					Any       		=[0] * limit
					for first_term in range(1							,a_					):
										for n in range(a_							,a_							,a_					):
															__UpperCamelCase      :					str       		=first_term + n / first_term
															if common_difference % 4:  # d must be divisble by 4
																				continue
															else:
																				common_difference /= 4
																				if (
																				    first_term > common_difference
																				    and first_term < 4 * common_difference
																				):  # since x,y,z are positive integers
																									frequency[n] += 1  # so z>0 and a>d ,also 4d<a

					__UpperCamelCase      :					Dict       		=sum(1 for x in frequency[1:limit] if x == 10					)

					return count


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


from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_sentencepiece_available


UpperCamelCase  							=						{}

try:
      if not is_sentencepiece_available():
            raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
      pass
else:
      UpperCamelCase  							=						['''GPTSw3Tokenizer''']


if TYPE_CHECKING:
      try:
            if not is_sentencepiece_available():
                  raise OptionalDependencyNotAvailable()
      except OptionalDependencyNotAvailable:
            pass
      else:
            from .tokenization_gpt_swa import GPTSwaTokenizer

else:
      import sys

      UpperCamelCase  							=						_LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)



