





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




def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		int:
       return choose(8 + n       ,		UpperCamelCase_	) + choose(9 + n       ,		UpperCamelCase_	) - 10




def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		int:
       return sum(non_bouncy_exact(UpperCamelCase_	) for i in range(1       ,		n + 1	)	)




def 			lowerCAmelCase_			(				UpperCamelCase_ = 100	)  ->		int:
       return non_bouncy_upto(UpperCamelCase_	)


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




"""simple docstring"""






from typing import TYPE_CHECKING

from ...utils import _LazyModule


__lowerCAmelCase				      =   {'''tokenization_phobert''': ['''PhobertTokenizer''']}


if TYPE_CHECKING:
							from .tokenization_phobert import PhobertTokenizer

else:
							import sys

							__lowerCAmelCase				      =   _LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)