



"""simple docstring"""

def __lowercase     (				_a       ):
    return str(__A       ) == str(__A       )[::-1]




def __lowercase     (				_a       ):
    return int(__A       ) + int(str(__A       )[::-1]       )




def __lowercase     (				_a = 10_000       ):
    snake_case_					:	int							=      []
    for num in range(1						,     __A       ):
        snake_case_					:	List[Any]							=      0
        snake_case_					:	Union[str, Any]							=      num
        while iterations < 50:
            snake_case_					:	Optional[Any]							=      sum_reverse(__A       )
            iterations += 1
            if is_palindrome(__A       ):
                break
        else:
            lychrel_nums.append(__A       )
    return len(__A       )


if __name__ == "__main__":
     print(f'{solution() = }')








from collections import deque





def      A__					(			__A  :						Optional[Any]			)					->Tuple:
      __A    =len(__A			)
      __A    =deque()
      __A    =[False for _ in range(__A			)]
      __A    =[-1 for _ in range(__A			)]
      __A    =index_of[:]

      def strong_connect(__A  :						Union[str, Any]     ,				__A  :						int     ,				__A  :						Optional[int]			):
            __A    =index  # the number when this node is seen
            __A    =index  # lowest rank node reachable from here
            index += 1
            stack.append(__A			)
            __A    =True

            for w in g[v]:
                  if index_of[w] == -1:
                        __A    =strong_connect(__A     ,				__A     ,				__A			)
                        __A    =(
                            lowlink_of[w] if lowlink_of[w] < lowlink_of[v] else lowlink_of[v]
                        )
                  elif on_stack[w]:
                        __A    =(
                            lowlink_of[w] if lowlink_of[w] < lowlink_of[v] else lowlink_of[v]
                        )

            if lowlink_of[v] == index_of[v]:
                  __A    =[]
                  __A    =stack.pop()
                  __A    =False
                  component.append(__A			)
                  while w != v:
                        __A    =stack.pop()
                        __A    =False
                        component.append(__A			)
                  components.append(__A			)
            return index

      __A    =[]
      for v in range(__A			):
            if index_of[v] == -1:
                  strong_connect(__A     ,				0     ,				__A			)

      return components





def      A__					(			__A  :						List[Any]     ,				__A  :						Optional[int]			)					->Tuple:
      __A    =[[] for _ in range(__A			)]
      for u, v in edges:
            g[u].append(__A			)
      return g


if __name__ == "__main__":
   # Test
   _lowerCamelCase      :					int					    =      7
   _lowerCamelCase      :					Tuple					    =      [0, 0, 1, 2, 3, 3, 4, 4, 6]
   _lowerCamelCase      :					Dict					    =      [1, 3, 2, 0, 1, 4, 5, 6, 5]
   _lowerCamelCase      :					Optional[Any]					    =      [(u, v) for u, v in zip(source, target)]
   _lowerCamelCase      :					Dict					    =      create_graph(n_vertices, edges)

   assert [[5], [6], [4], [3, 2, 1, 0]] == tarjan(g)


