






"""simple docstring"""






from __future__ import annotations

from random import choice



def 					_A			(__a							) ->       Optional[int]:
    """simple docstring"""






    return choice(__a							)



def 					_A			(__a    ,				__a							) ->       int:
    """simple docstring"""






    SCREAMING_SNAKE_CASE_      :  Any    						=		random_pivot(__a							)

    # partition based on pivot
    # linear time
    SCREAMING_SNAKE_CASE_      :  Any    						=		[e for e in lst if e < pivot]
    SCREAMING_SNAKE_CASE_      :  Tuple    						=		[e for e in lst if e > pivot]

    # if we get lucky, pivot might be the element we want.
    # we can easily see this:
    # small (elements smaller than k)
    # + pivot (kth element)
    # + big (elements larger than k)
    if len(__a							) == k - 1:
        return pivot
    # pivot is in elements bigger than k
    elif len(__a							) < k - 1:
        return kth_number(__a    ,				k - len(__a							) - 1							)
    # pivot is in elements smaller than k
    else:
        return kth_number(__a    ,				__a							)


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() = }''')

