

def 	_snake_case		(    SCREAMING_SNAKE_CASE = 50				)       ->      int:

     """simple docstring"""







     _lowerCAmelCase   :					List[Any]        =    [1] * (length + 1)

     for row_length in range(3		,							length + 1				):
          for block_length in range(3		,							row_length + 1				):
               for block_start in range(row_length - block_length				):
                    ways_number[row_length] += ways_number[
                        row_length - block_start - block_length - 1
                    ]

               ways_number[row_length] += 1

     return ways_number[length]


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









# Author: OMKAR PATHAK, Nwachukwu Chidiebere

# Use a Python dictionary to construct the graph.
from __future__ import annotations

from pprint import pformat
from typing import Generic, TypeVar

__UpperCAmelCase    				=     TypeVar('T')





class A__    ( Generic[T] ):



 """simple docstring"""







 def __init__(		self :	Optional[int]     ,						A_ :	bool = True       ):






      '''simple docstring'''




      _lowerCAmelCase   :					dict[T, list[T]]        =    {}  # dictionary of lists
      _lowerCAmelCase   :					List[Any]        =    directed

 def    __magic_name__       (		self :	Any     ,						A_ :	T     ,						A_ :	T       ):






      '''simple docstring'''




      if not self.directed:  # For undirected graphs
           # if both source vertex and destination vertex are both present in the
           # adjacency list, add destination vertex to source vertex list of adjacent
           # vertices and add source vertex to destination vertex list of adjacent
           # vertices.
           if source_vertex in self.adj_list and destination_vertex in self.adj_list:
                self.adj_list[source_vertex].append(A_       )
                self.adj_list[destination_vertex].append(A_       )
           # if only source vertex is present in adjacency list, add destination vertex
           # to source vertex list of adjacent vertices, then create a new vertex with
           # destination vertex as key and assign a list containing the source vertex
           # as it's first adjacent vertex.
           elif source_vertex in self.adj_list:
                self.adj_list[source_vertex].append(A_       )
                _lowerCAmelCase   :					List[Any]        =    [source_vertex]
           # if only destination vertex is present in adjacency list, add source vertex
           # to destination vertex list of adjacent vertices, then create a new vertex
           # with source vertex as key and assign a list containing the source vertex
           # as it's first adjacent vertex.
           elif destination_vertex in self.adj_list:
                self.adj_list[destination_vertex].append(A_       )
                _lowerCAmelCase   :					List[str]        =    [destination_vertex]
           # if both source vertex and destination vertex are not present in adjacency
           # list, create a new vertex with source vertex as key and assign a list
           # containing the destination vertex as it's first adjacent vertex also
           # create a new vertex with destination vertex as key and assign a list
           # containing the source vertex as it's first adjacent vertex.
           else:
                _lowerCAmelCase   :					List[str]        =    [destination_vertex]
                _lowerCAmelCase   :					Dict        =    [source_vertex]
      else:  # For directed graphs
           # if both source vertex and destination vertex are present in adjacency
           # list, add destination vertex to source vertex list of adjacent vertices.
           if source_vertex in self.adj_list and destination_vertex in self.adj_list:
                self.adj_list[source_vertex].append(A_       )
           # if only source vertex is present in adjacency list, add destination
           # vertex to source vertex list of adjacent vertices and create a new vertex
           # with destination vertex as key, which has no adjacent vertex
           elif source_vertex in self.adj_list:
                self.adj_list[source_vertex].append(A_       )
                _lowerCAmelCase   :					Tuple        =    []
           # if only destination vertex is present in adjacency list, create a new
           # vertex with source vertex as key and assign a list containing destination
           # vertex as first adjacent vertex
           elif destination_vertex in self.adj_list:
                _lowerCAmelCase   :					Dict        =    [destination_vertex]
           # if both source vertex and destination vertex are not present in adjacency
           # list, create a new vertex with source vertex as key and a list containing
           # destination vertex as it's first adjacent vertex. Then create a new vertex
           # with destination vertex as key, which has no adjacent vertex
           else:
                _lowerCAmelCase   :					Any        =    [destination_vertex]
                _lowerCAmelCase   :					Union[str, Any]        =    []

      return self


 def __repr__(		self :	List[str]       ):






      '''simple docstring'''




      return pformat(self.adj_list       )






