






'''simple docstring'''





import math
def       a__						(  A					):
   if n <= 0:
      raise ValueError("""Only positive integers have prime factors"""					)
   lowercase__						:	Optional[Any]         = []
   while n % 2 == 0:
      pf.append(2					)
      lowercase__						:	Tuple         = int(n / 2					)
   for i in range(3		,				int(math.sqrt(A					)					) + 1		,				2					):
      while n % i == 0:
         pf.append(A					)
         lowercase__						:	Dict         = int(n / i					)
   if n > 2:
      pf.append(A					)
   return pf
def       a__						(  A					):
   if n <= 0:
      raise ValueError("""Only positive numbers are accepted"""					)
   lowercase__						:	Dict         = 1
   lowercase__						:	Optional[Any]         = 1
   while n % 2 == 0:
      temp += 1
      lowercase__						:	str         = int(n / 2					)
   div *= temp
   for i in range(3		,				int(math.sqrt(A					)					) + 1		,				2					):
      lowercase__						:	Tuple         = 1
      while n % i == 0:
         temp += 1
         lowercase__						:	Dict         = int(n / i					)
      div *= temp
   if n > 1:
      div *= 2
   return div
def       a__						(  A					):
   if n <= 0:
      raise ValueError("""Only positive numbers are accepted"""					)
   lowercase__						:	Tuple         = 1
   lowercase__						:	Optional[Any]         = 1
   while n % 2 == 0:
      temp += 1
      lowercase__						:	List[str]         = int(n / 2					)
   if temp > 1:
      s *= (2**temp - 1) / (2 - 1)
   for i in range(3		,				int(math.sqrt(A					)					) + 1		,				2					):
      lowercase__						:	List[Any]         = 1
      while n % i == 0:
         temp += 1
         lowercase__						:	Tuple         = int(n / i					)
      if temp > 1:
         s *= (i**temp - 1) / (i - 1)
   return int(A					)
def       a__						(  A					):
   lowercase__						:	Dict         = n
   for x in set(prime_factors(A					)					):
      s *= (x - 1) / x
   return int(A					)


if __name__ == "__main__":
 import doctest

 doctest.testmod()










a    =       10**8
def       a__						(  A					):
   if n % 10 == 0:
      return False
   lowercase__						:	Optional[Any]         = str(A					)
   return s == s[::-1]
def       a__						(  ):
   lowercase__						:	Union[str, Any]         = set()
   lowercase__						:	Dict         = 1
   lowercase__						:	List[str]         = 5
   while sum_squares < LIMIT:
      lowercase__						:	Tuple         = 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
      lowercase__						:	Any         = first_square**2 + (first_square + 1) ** 2

   return sum(A					)


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


