




import random




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						List[Any]:

    """simple docstring"""


    def is_sorted(lowercase_   ):
        for i in range(len(lowerCAmelCase_   ) - 1   ):
            if collection[i] > collection[i + 1]:
                return False
        return True

    while not is_sorted(lowerCAmelCase_   ):
        random.shuffle(lowerCAmelCase_   )
    return collection


if __name__ == "__main__":
 a_ 		=  input("Enter numbers separated by a comma:\n").strip()
 a_ 		=  [int(item) for item in user_input.split(",")]
 print(bogo_sort(unsorted))









_lowerCamelCase							=[
    ["ab-e1", "ac-e3", "ad-e5", "bc-e4", "bd-e2", "be-e6", "bh-e12", "cd-e2", "ce-e4",
     "de-e1", "df-e8", "dg-e5", "dh-e10", "ef-e3", "eg-e2", "fg-e6", "gh-e6", "hi-e3"],
    ["ab-e1", "ac-e3", "ad-e5", "bc-e4", "bd-e2", "be-e6", "cd-e2", "de-e1", "df-e8",
     "ef-e3", "eg-e2", "fg-e6"],
    ["ab-e1", "ac-e3", "bc-e4", "bd-e2", "de-e1", "df-e8", "dg-e5", "ef-e3", "eg-e2",
     "eh-e12", "fg-e6", "fh-e10", "gh-e6"],
    ["ab-e1", "ac-e3", "bc-e4", "bd-e2", "bh-e12", "cd-e2", "df-e8", "dh-e10"],
    ["ab-e1", "ac-e3", "ad-e5", "bc-e4", "bd-e2", "cd-e2", "ce-e4", "de-e1", "df-e8",
     "dg-e5", "ef-e3", "eg-e2", "fg-e6"]
]







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=set()
     for row in edge_array:
          for item in row:
               distinct_edge.add(item[0]     )
     return list(lowerCAmelCase_     )







def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=['0'] * len(lowerCAmelCase_     )
     for i, row in enumerate(lowerCAmelCase_     ):
          for item in row:
               if distinct_edge in item[0]:
                    SCREAMING_SNAKE_CASE 		='1'
                    break
     return "".join(lowerCAmelCase_     )







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=get_distinct_edge(lowerCAmelCase_     )
     SCREAMING_SNAKE_CASE 		={}

     for item in distinct_edge:
          SCREAMING_SNAKE_CASE 		=get_bitcode(lowerCAmelCase_,       lowerCAmelCase_     )
          # print('bit',bit)
          # bt=''.join(bit)
          SCREAMING_SNAKE_CASE 		=bit.count('1'     )
          SCREAMING_SNAKE_CASE 		=[s, bit]
     # Store [Distinct edge, WT(Bitcode), Bitcode] in descending order
     SCREAMING_SNAKE_CASE 		=[
         [k, v[0], v[1]]
         for k, v in sorted(frequency_table.items(),       key=lambda lowerCAmelCase_     : v[1][0],       reverse=lowerCAmelCase_     )
     ]
     return sorted_frequency_table







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		={}
     for _, item in enumerate(lowerCAmelCase_     ):
          nodes.setdefault(item[2],       []     ).append(item[0]     )
     return nodes







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		={}
     for key, value in nodes.items():
          SCREAMING_SNAKE_CASE 		=value
     return cluster







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     return [i * 100 / len(lowerCAmelCase_     ) for i in cluster]







def      snake_case__							(  ):





     """simple docstring"""







     print('\nNodes\n'     )
     for key, value in nodes.items():
          print(lowerCAmelCase_,       lowerCAmelCase_     )
     print('\nSupport\n'     )
     print(lowerCAmelCase_     )
     print('\n Cluster \n'     )
     for key, value in sorted(cluster.items(),       reverse=lowerCAmelCase_     ):
          print(lowerCAmelCase_,       lowerCAmelCase_     )
     print('\n Graph\n'     )
     for key, value in graph.items():
          print(lowerCAmelCase_,       lowerCAmelCase_     )
     print('\n Edge List of Frequent subgraphs \n'     )
     for edge_list in freq_subgraph_edge_list:
          print(lowerCAmelCase_     )







def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_     ):





     """simple docstring"""







     for i in cluster[ca]:
          SCREAMING_SNAKE_CASE 		=0
          SCREAMING_SNAKE_CASE 		=ca + 1
          while ca < max(cluster.keys()     ):
               for j in cluster[ca]:
                    if int(lowerCAmelCase_,       2     ) & int(lowerCAmelCase_,       2     ) == int(lowerCAmelCase_,       2     ):
                         if tuple(nodes[i]     ) in graph:
                              graph[tuple(nodes[i]     )].append(nodes[j]     )
                         else:
                              SCREAMING_SNAKE_CASE 		=[nodes[j]]
                         count += 1
               if count == 0:
                    SCREAMING_SNAKE_CASE 		=ca + 1
               else:
                    break







def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=cluster[max(cluster.keys()     )]
     SCREAMING_SNAKE_CASE 		='Header'
     SCREAMING_SNAKE_CASE 		={}
     for i in x:
          if (["Header"],) in graph:
               graph[(["Header"],)].append(x[i]     )
          else:
               SCREAMING_SNAKE_CASE 		=[x[i]]
     for i in x:
          SCREAMING_SNAKE_CASE 		=[['Header']]
     SCREAMING_SNAKE_CASE 		=1
     while i < max(lowerCAmelCase_     ) - 1:
          create_edge(lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_     )
          SCREAMING_SNAKE_CASE 		=i + 1
     return graph







def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_=None     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=(path or []) + [start]
     if start == end:
          paths.append(lowerCAmelCase_     )
     for node in graph[start]:
          if tuple(lowerCAmelCase_     ) not in path:
               my_dfs(lowerCAmelCase_,       tuple(lowerCAmelCase_     ),       lowerCAmelCase_,       lowerCAmelCase_     )







def      snake_case__							(  lowerCAmelCase_,       lowerCAmelCase_,       lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=int(s / 100 * (len(lowerCAmelCase_     ) - 1)     )
     for i in cluster[k]:
          my_dfs(lowerCAmelCase_,       tuple(cluster[k][i]     ),       (['Header'],)     )







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     SCREAMING_SNAKE_CASE 		=[]
     for edges in paths:
          SCREAMING_SNAKE_CASE 		=[]
          for j in range(len(lowerCAmelCase_     ) - 1     ):
               SCREAMING_SNAKE_CASE 		=list(edges[j]     )
               for e in temp:
                    SCREAMING_SNAKE_CASE 		=(e[0], e[1])
                    el.append(lowerCAmelCase_     )
          freq_sub_el.append(lowerCAmelCase_     )
     return freq_sub_el







def      snake_case__							(  lowerCAmelCase_     ):





     """simple docstring"""







     for i in range(len(lowerCAmelCase_     )     ):
          for j in range(len(edge_array[i]     )     ):
               SCREAMING_SNAKE_CASE 		=edge_array[i][j].split('-'     )
               SCREAMING_SNAKE_CASE 		=t


if __name__ == "__main__":
 preprocess(edge_array)
 _lowerCamelCase							=get_frequency_table(edge_array)
 _lowerCamelCase							=get_nodes(frequency_table)
 _lowerCamelCase							=get_cluster(nodes)
 _lowerCamelCase							=get_support(cluster)
 _lowerCamelCase							=construct_graph(cluster, nodes)
 find_freq_subgraph_given_support(60, cluster, graph)
 _lowerCamelCase							=[]
 _lowerCamelCase							=freq_subgraphs_edge_list(paths)
 print_all()

