

"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					int = 1000			):
     A__										=  2**power
     A__										=  str(UpperCAmelCase_			)
     A__										=  list(UpperCAmelCase_			)
     A__										=  0

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

     return sum_of_num


if __name__ == "__main__":
 SCREAMING_SNAKE_CASE_					:	List[Any]							  =						int(input('Enter the power of 2: ').strip())
 print('2 ^ ', power, ' = ', 2**power)
 SCREAMING_SNAKE_CASE_					:	Tuple							  =						solution(power)
 print('Sum of the digits is: ', result)









"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					List[str]			):
     A__										=  [0] * len(UpperCAmelCase_			)
     A__										=  []
     A__										=  [1] * len(UpperCAmelCase_			)

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

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

     while queue:
          A__										=  queue.pop(0			)
          for x in graph[vertex]:
               indegree[x] -= 1

               if long_dist[vertex] + 1 > long_dist[x]:
                    A__										=  long_dist[vertex] + 1

               if indegree[x] == 0:
                    queue.append(UpperCAmelCase_			)

     print(max(UpperCAmelCase_			)			)


# Adjacency list of Graph
SCREAMING_SNAKE_CASE_					:	Any							  =						{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}

longest_distance(graph)






