



'''simple docstring'''





def lowerCAmelCase						(__A):



     """simple docstring"""



     _a											=						[0] * len(__A)
     _a											=						[]
     _a											=						[]
     _a											=						0

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

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

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

     if cnt != len(__A):
          print('''Cycle exists''')
     else:
          print(__A)


# Adjacency List of Graph
lowercase_	 =						{0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}
topological_sort(graph)








'''simple docstring'''





def lowerCAmelCase						(__A = 1_000):



     """simple docstring"""



     _a											=						2**power
     _a											=						str(__A)
     _a											=						list(__A)
     _a											=						0

     for i in list_num:
          sum_of_num += int(__A)

     return sum_of_num


if __name__ == "__main__":
  lowercase_	 =						int(input("Enter the power of 2: ").strip())
  print("2 ^ ", power, " = ", 2**power)
  lowercase_	 =						solution(power)
  print("Sum of the digits is: ", result)



