



def        lowerCAmelCase_(   lowercase_     :							Optional[Any] = 1_00_00_00							)	->       str:
				_lowerCamelCase        =				limit + 1
				_lowerCamelCase        =				[0] * limit
				for first_term in range(1						,   snake_case_							):
								for n in range(snake_case_						,   snake_case_						,   snake_case_							):
												_lowerCamelCase        =				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

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

				return count


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





"""simple docstring"""
def        lowerCAmelCase_(   lowercase_     :							str						,   lowercase_     :							str							)	->       bool:
				_lowerCamelCase        =				len(lowercase_							)
				_lowerCamelCase        =				len(lowercase_							)
				_lowerCamelCase        =				[[False for _ in range(m + 1							)] for _ in range(n + 1							)]
				_lowerCamelCase        =				True
				for i in range(lowercase_							):
								for j in range(m + 1							):
												if dp[i][j]:
																if j < m and a[i].upper() == b[j]:
																				_lowerCamelCase        =				True
																if a[i].islower():
																				_lowerCamelCase        =				True
				return dp[n][m]


if __name__ == "__main__":
			import doctest

			doctest.testmod()
