'''simple docstring'''
def 			_UpperCamelCase			(  _a						:						int = 1_0_0      ):




    """simple docstring"""



    __UpperCamelCase						:						Dict		     =	[[0 for _ in range(_a      )] for _ in range(m + 1      )]
    for i in range(m + 1      ):
        __UpperCamelCase						:						List[Any]		     =	1

    for n in range(m + 1      ):
        for k in range(1					,  _a      ):
            memo[n][k] += memo[n][k - 1]
            if n > k:
                memo[n][k] += memo[n - k - 1][k]

    return memo[m][m - 1] - 1


if __name__ == "__main__":
  print(solution(int(input('''Enter a number: ''').strip())))





'''simple docstring'''





from collections import Counter
from functools import total_ordering

from data_structures.heap.heap import Heap



@total_ordering
class 			lowerCAmelCase__ :



  '''simple docstring'''






  def __init__(self	:			Tuple						,			lowerCAmelCase_	:			str						,			lowerCAmelCase_	:			int     ) ->							None:
        snake_case_    							=				word
        snake_case_    							=				count

  def __eq__(self	:			List[Any]						,			lowerCAmelCase_	:			object     ) ->							bool:
        if not isinstance(lowerCAmelCase_						,			lowerCAmelCase_     ):
              return NotImplemented
        return self.count == other.count


  def __lt__(self	:			Tuple						,			lowerCAmelCase_	:			object     ) ->							bool:
        if not isinstance(lowerCAmelCase_						,			lowerCAmelCase_     ):
              return NotImplemented
        return self.count < other.count

def 	snake_case_							(				_a  :				list[str]			,       _a  :				int      ):
      snake_case_    							=				Heap()
      snake_case_    							=				Counter(_a      )
      heap.build_max_heap(
          [WordCount(_a			,       _a      ) for word, count in count_by_word.items()]      )
      return [heap.extract_max().word for _ in range(min(_a			,       len(_a      )      )      )]


if __name__ == "__main__":
     import doctest

     doctest.testmod()

