def 							lowerCAmelCase(     __lowerCamelCase = 100_0000						):
					__a		 =       limit + 1
					__a		 =       [0] * limit
					for first_term in range(1				,    __lowerCamelCase						):
										for n in range(__lowerCamelCase				,    __lowerCamelCase				,    __lowerCamelCase						):
															__a		 =       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

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

					return count


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





from __future__ import annotations

import numpy as np
def 							lowerCAmelCase(     __lowerCamelCase						):
					return np.maximum(0				,    __lowerCamelCase						)


if __name__ == "__main__":
	print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]




