

from __future__ import annotations

import math
import random





def 				__a							(       __A			,							__A			,							__A						):
    SCREAMING_SNAKE_CASE__         =    d * e - 1
    SCREAMING_SNAKE_CASE__         =    0
    SCREAMING_SNAKE_CASE__         =    0
    while p == 0:
        SCREAMING_SNAKE_CASE__         =    random.randint(2			,							n - 1						)
        SCREAMING_SNAKE_CASE__         =    k
        while True:
            if t % 2 == 0:
                SCREAMING_SNAKE_CASE__         =    t // 2
                SCREAMING_SNAKE_CASE__         =    (g**t) % n
                SCREAMING_SNAKE_CASE__         =    math.gcd(x - 1			,							__A						)
                if x > 1 and y > 1:
                    SCREAMING_SNAKE_CASE__         =    y
                    SCREAMING_SNAKE_CASE__         =    n // y
                    break  # find the correct factors
            else:
                break  # t is not divisible by 2, break and choose another g
    return sorted([p, q]						)


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())


