



'''simple docstring'''





def 						__snake_case(				_lowerCAmelCase = 1_000_000		)		-> int:
      snake_case__  :    int    						=      limit + 1
      snake_case__  :    Dict    						=      [0] * limit
      for first_term in range(1     ,   _lowerCAmelCase		):
            for n in range(_lowerCAmelCase     ,   _lowerCAmelCase     ,   _lowerCAmelCase		):
                  snake_case__  :    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

      snake_case__  :    List[str]    						=      sum(1 for x in frequency[1:limit] if x == 10		)

      return count


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





'''simple docstring'''





from transformers import BertTokenizerFast

from .custom_tokenization import CustomTokenizer







class     UpperCAmelCase_       (       _a	):
    """simple docstring"""







    lowercase					=		CustomTokenizer
    pass
