

'''simple docstring'''
def        _lowerCAmelCase					(						_UpperCamelCase						:     str							, _UpperCamelCase						:     str				)      ->			bool:
     """simple docstring"""




     _SCREAMING_SNAKE_CASE							    =len(_UpperCamelCase				)
     _SCREAMING_SNAKE_CASE							    =len(_UpperCamelCase				)
     _SCREAMING_SNAKE_CASE							    =[[False for _ in range(m + 1				)] for _ in range(n + 1				)]
     _SCREAMING_SNAKE_CASE							    =True
     for i in range(_UpperCamelCase				):
          for j in range(m + 1				):
               if dp[i][j]:
                    if j < m and a[i].upper() == b[j]:
                         _SCREAMING_SNAKE_CASE							    =True
                    if a[i].islower():
                         _SCREAMING_SNAKE_CASE							    =True
     return dp[n][m]


if __name__ == "__main__":
     import doctest

     doctest.testmod()


'''simple docstring'''







def 				SCREAMING_SNAKE_CASE__	(   __A = 1_000_000	)       ->	int:
	_snake_case   						=		limit + 1
	_snake_case   						=		[0] * limit
	for first_term in range(1			,				__A	):
		for n in range(__A			,				__A			,				__A	):
			_snake_case   						=		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   						=		sum(1 for x in frequency[1:limit] if x == 10	)

	return count


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

