



'''simple docstring'''



def 							__UpperCAmelCase				(				UpperCamelCase__				:list[int | list]   ,				UpperCamelCase__				:int			)		->						int:
				snake_case__      :   str      =    0
				for ele in arr:
								total_sum += product_sum(UpperCamelCase__   ,				depth + 1			) if isinstance(UpperCamelCase__   ,				UpperCamelCase__			) else ele
				return total_sum * depth


def 							__UpperCAmelCase				(				UpperCamelCase__				:list[int | list]			)		->						int:
				return product_sum(UpperCamelCase__   ,				1			)


if __name__ == "__main__":
				import doctest

				doctest.testmod()







A__										=      10**8





def 				__a							(       __A						):
    if n % 10 == 0:
        return False
    SCREAMING_SNAKE_CASE__         =    str(__A						)
    return s == s[::-1]





def 				__a							(       ):
    SCREAMING_SNAKE_CASE__         =    set()
    SCREAMING_SNAKE_CASE__         =    1
    SCREAMING_SNAKE_CASE__         =    5
    while sum_squares < LIMIT:
        SCREAMING_SNAKE_CASE__         =    first_square + 1
        while sum_squares < LIMIT:
            if is_palindrome(__A						):
                answer.add(__A						)
            last_square += 1
            sum_squares += last_square**2
        first_square += 1
        SCREAMING_SNAKE_CASE__         =    first_square**2 + (first_square + 1) ** 2

    return sum(__A						)


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


