


"""simple docstring"""






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

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

				return count


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




"""simple docstring"""






from __future__ import annotations


def __lowercase     (      lowerCamelCase_  :      list						,					lowerCamelCase_  :      int						,					lowerCamelCase_  :      int						,					lowerCamelCase_  :      int  ):
				SCREAMING_SNAKE_CASE__     							=				[]
				SCREAMING_SNAKE_CASE__							,      SCREAMING_SNAKE_CASE__     							=				input_list[low:mid], input_list[mid : high + 1]
				while left and right:
								result.append((left if left[0] <= right[0] else right).pop(0  )  )
				SCREAMING_SNAKE_CASE__     							=				result + left + right
				return input_list


def __lowercase     (      lowerCamelCase_  :      list  ):
				if len(lowerCamelCase_  ) <= 1:
								return input_list
				SCREAMING_SNAKE_CASE__     							=				list(lowerCamelCase_  )

				# iteration for two-way merging
				SCREAMING_SNAKE_CASE__     							=				2
				while p <= len(lowerCamelCase_  ):
								# getting low, high and middle value for merge-sort of single list
								for i in range(0						,					len(lowerCamelCase_  )						,					lowerCamelCase_  ):
												SCREAMING_SNAKE_CASE__     							=				i
												SCREAMING_SNAKE_CASE__     							=				i + p - 1
												SCREAMING_SNAKE_CASE__     							=				(low + high + 1) // 2
												SCREAMING_SNAKE_CASE__     							=				merge(lowerCamelCase_						,					lowerCamelCase_						,					lowerCamelCase_						,					lowerCamelCase_  )
								# final merge of last two parts
								if p * 2 >= len(lowerCamelCase_  ):
												SCREAMING_SNAKE_CASE__     							=				i
												SCREAMING_SNAKE_CASE__     							=				merge(lowerCamelCase_						,					0						,					lowerCamelCase_						,					len(lowerCamelCase_  ) - 1  )
												break
								p *= 2

				return input_list


if __name__ == "__main__":
	_lowerCamelCase     =  input('Enter numbers separated by a comma:\n').strip()
	if user_input == "":
		_lowerCamelCase     =  []
	else:
		_lowerCamelCase     =  [int(item.strip()) for item in user_input.split(',')]
	print(iter_merge_sort(unsorted))
