


"""simple docstring"""


def 	snake_case    (					_a:  str		, _a:  str				)->		bool:
      '''simple docstring'''


      lowerCamelCase__							     =		len(lowerCAmelCase_				)
      lowerCamelCase__							     =		len(lowerCAmelCase_				)
      lowerCamelCase__							     =		[[False for _ in range(m + 1				)] for _ in range(n + 1				)]
      lowerCamelCase__							     =		True
      for i in range(lowerCAmelCase_				):
            for j in range(m + 1				):
                  if dp[i][j]:
                        if j < m and a[i].upper() == b[j]:
                              lowerCamelCase__							     =		True
                        if a[i].islower():
                              lowerCamelCase__							     =		True
      return dp[n][m]


if __name__ == "__main__":
   import doctest

   doctest.testmod()







from math import factorial



def       _lowerCAmelCase    (				lowerCAmelCase_				:int = 20				)->int:
   '''simple docstring'''






   snake_case_            =       2 * n  # middle entry of odd rows starting at row 3 is the solution for n = 1,
   # 2, 3,...
   snake_case_            =       n // 2

   return int(factorial(lowerCAmelCase_				) / (factorial(lowerCAmelCase_				) * factorial(n - k				))				)


if __name__ == "__main__":
   import sys

   if len(sys.argv) == 1:
      print(solution(20))
   else:
      try:
         SCREAMING_SNAKE_CASE						:Any			=  int(sys.argv[1])
         print(solution(n))
      except ValueError:
         print('''Invalid entry - please enter a number.''')




