






"""simple docstring"""



def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  list   ):





  '''simple docstring'''





  if not isinstance(__snake_case		, __snake_case   ):
    raise ValueError('Input series is not valid, valid series - [2, 4, 8]'   )
  if len(__snake_case   ) == 0:
    raise ValueError('Input list must be a non empty list'   )
  if len(__snake_case   ) == 1:
    return True
  try:
    lowercase							   =	series[1] / series[0]
    for index in range(len(__snake_case   ) - 1   ):
      if series[index + 1] / series[index] != common_ratio:
        return False
  except ZeroDivisionError:
    return False
  return True
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  list   ):





  '''simple docstring'''





  if not isinstance(__snake_case		, __snake_case   ):
    raise ValueError('Input series is not valid, valid series - [2, 4, 8]'   )
  if len(__snake_case   ) == 0:
    raise ValueError('Input list must be a non empty list'   )
  lowercase							   =	1
  for value in series:
    answer *= value
  return pow(__snake_case		, 1 / len(__snake_case   )   )


if __name__ == "__main__":
    import doctest

    doctest.testmod()










"""simple docstring"""



_UpperCamelCase		:  str						=		1_0**8
def 						_SCREAMING_SNAKE_CASE			(   __snake_case      :  int   ):





  '''simple docstring'''





  if n % 10 == 0:
    return False
  lowercase							   =	str(__snake_case   )
  return s == s[::-1]
def 						_SCREAMING_SNAKE_CASE			(   ):





  '''simple docstring'''





  lowercase							   =	set()
  lowercase							   =	1
  lowercase							   =	5
  while sum_squares < LIMIT:
    lowercase							   =	first_square + 1
    while sum_squares < LIMIT:
      if is_palindrome(__snake_case   ):
        answer.add(__snake_case   )
      last_square += 1
      sum_squares += last_square**2
    first_square += 1
    lowercase							   =	first_square**2 + (first_square + 1) ** 2

  return sum(__snake_case   )


if __name__ == "__main__":
    print(solution())


