

"""simple docstring"""



from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst





def  _snake_case     (    ):
     A__			,				A__										=  9, 14  # noqa: F841
     A__										=  [
         [0, 1, 4],
         [0, 7, 8],
         [1, 2, 8],
         [7, 8, 7],
         [7, 6, 1],
         [2, 8, 2],
         [8, 6, 6],
         [2, 3, 7],
         [2, 5, 4],
         [6, 5, 2],
         [3, 5, 14],
         [3, 4, 9],
         [5, 4, 10],
         [1, 7, 11],
     ]

     A__										=  defaultdict(UpperCAmelCase_			)
     for nodea, nodea, cost in edges:
          adjancency[nodea].append([nodea, cost]			)
          adjancency[nodea].append([nodea, cost]			)

     A__										=  mst(UpperCAmelCase_			)

     A__										=  [
         [7, 6, 1],
         [2, 8, 2],
         [6, 5, 2],
         [0, 1, 4],
         [2, 5, 4],
         [2, 3, 7],
         [0, 7, 8],
         [3, 4, 9],
     ]

     for answer in expected:
          A__										=  tuple(answer[:2]			)
          A__										=  tuple(edge[::-1]			)
          assert edge in result or reverse in result









"""simple docstring"""



from itertools import count





def  _snake_case     (    UpperCAmelCase_  :					int = 50			):
     A__										=  [1] * min_block_length

     for n in count(UpperCAmelCase_			):
          fill_count_functions.append(1			)

          for block_length in range(UpperCAmelCase_					,   n + 1			):
               for block_start in range(n - block_length			):
                    fill_count_functions[n] += fill_count_functions[
                        n - block_start - block_length - 1
                    ]

               fill_count_functions[n] += 1

          if fill_count_functions[n] > 100_0000:
               break

     return n


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






