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

def 	__lowerCamelCase							(				__a    : int		)      ->       int:
	return choose(8 + n      ,							__a		) + choose(9 + n      ,							__a		) - 10

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

def 	__lowerCamelCase							(				__a    : int = 100		)      ->       int:
	return non_bouncy_upto(__a		)


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





def 	__lowerCamelCase							(				)      ->       Dict:
	_lowercase   =1

	while True:
		if (
		    sorted(str(__a		)		)
		    == sorted(str(2 * i		)		)
		    == sorted(str(3 * i		)		)
		    == sorted(str(4 * i		)		)
		    == sorted(str(5 * i		)		)
		    == sorted(str(6 * i		)		)
		):
			return i

		i += 1


if __name__ == "__main__":
						print(solution())




