





'''simple docstring'''
def     lowercase__       (       __lowercase						:  int    ,  __lowercase						:  int					)			->				int:



       """simple docstring"""






       __UpperCamelCase	=  1.0
       for i in range(1    ,  r + 1					):
              ret *= (n + 1 - i) / i
       return round(__lowercase					)
def     lowercase__       (       __lowercase						:  int					)			->				int:



       """simple docstring"""






       return choose(8 + n    ,  __lowercase					) + choose(9 + n    ,  __lowercase					) - 10
def     lowercase__       (       __lowercase						:  int					)			->				int:



       """simple docstring"""






       return sum(non_bouncy_exact(__lowercase					) for i in range(1    ,  n + 1					)					)
def     lowercase__       (       __lowercase						:  int = 100					)			->				int:



       """simple docstring"""






       return non_bouncy_upto(__lowercase					)


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











'''simple docstring'''
def     lowercase__       (       __lowercase						:  int = 20					)			->				int:



       """simple docstring"""






       try:
              __UpperCamelCase	=  int(__lowercase					)
       except (TypeError, ValueError):
              raise TypeError('Parameter n must be int or castable to int.'					)
       if n <= 0:
              raise ValueError('Parameter n must be greater than or equal to one.'					)
       __UpperCamelCase	=  0
       while 1:
              i += n * (n - 1)
              __UpperCamelCase	=  0
              for j in range(2    ,  __lowercase					):
                     if i % j != 0:
                            __UpperCamelCase	=  1
                            break
              if nfound == 0:
                     if i == 0:
                            __UpperCamelCase	=  1
                     return i
       return None


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