





def     _lowerCAmelCase		(  _lowerCAmelCase     ):
   '''simple docstring'''


   return str(__UpperCAmelCase     ) == str(__UpperCAmelCase     )[::-1]



def     _lowerCAmelCase		(  _lowerCAmelCase     ):
   '''simple docstring'''


   return int(__UpperCAmelCase     ) + int(str(__UpperCAmelCase     )[::-1]     )



def     _lowerCAmelCase		(  _lowerCAmelCase = 1_0_0_0_0     ):
   '''simple docstring'''


   A_     :				str			      =	[]
   for num in range(1  ,__UpperCAmelCase     ):
      A_     :				str			      =	0
      A_     :				Dict			      =	num
      while iterations < 5_0:
         A_     :				Union[str, Any]			      =	sum_reverse(__UpperCAmelCase     )
         iterations += 1
         if is_palindrome(__UpperCAmelCase     ):
            break
      else:
         lychrel_nums.append(__UpperCAmelCase     )
   return len(__UpperCAmelCase     )


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













def     _lowerCAmelCase		(  _lowerCAmelCase     ):
   '''simple docstring'''


   A_     :				Union[str, Any]			      =	[0] * len(_lowerCAmelCase     )
   A_     :				Optional[int]			      =	[]
   A_     :				str			      =	[]
   A_     :				Dict			      =	0

   for values in graph.values():
      for i in values:
         indegree[i] += 1

   for i in range(len(_lowerCAmelCase     )     ):
      if indegree[i] == 0:
         queue.append(_lowerCAmelCase     )

   while queue:
      A_     :				List[str]			      =	queue.pop(0     )
      cnt += 1
      topo.append(_lowerCAmelCase     )
      for x in graph[vertex]:
         indegree[x] -= 1
         if indegree[x] == 0:
            queue.append(_lowerCAmelCase     )

   if cnt != len(_lowerCAmelCase     ):
      print("""Cycle exists"""     )
   else:
      print(_lowerCAmelCase     )


# Adjacency List of Graph
_lowerCAmelCase 				=     {0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}







topological_sort(graph)






