





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

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

		return count


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











def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case						,   snake_case							)		->    bool:
		return not any(
		    neighbour == 1 and colored_vertices[i] == color
		    for i, neighbour in enumerate(snake_case							)							)



def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case						,   snake_case						,   snake_case							)		->    bool:

		# Base Case
		if index == len(snake_case							):
				return True

		# Recursive Step
		for i in range(snake_case							):
				if valid_coloring(graph[index]						,   snake_case						,   snake_case							):
						# Color current vertex
						__lowercase											=     i
						# Validate coloring
						if util_color(snake_case						,   snake_case						,   snake_case						,   index + 1							):
								return True
						# Backtrack
						__lowercase											=     -1
		return False



def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case							)		->    list[int]:
		__lowercase											=     [-1] * len(snake_case							)

		if util_color(snake_case						,   snake_case						,   snake_case						,   0							):
				return colored_vertices

		return []




