from math import factorial







def 						A__  (					__A   , __A	):

    # If either of the conditions are true, the function is being asked
    # to calculate a factorial of a negative number, which is not possible
    if n < k or k < 0:
        raise ValueError("""Please enter positive integers for n and k where n >= k"""	)
    return factorial(__A	) // (factorial(__A	) * factorial(n - k	))


if __name__ == "__main__":
    print(
        "The number of five-card hands possible from a standard",
        F"""fifty-two card deck is: {combinations(52, 5)}\n""",
    )

    print(
        "If a class of 40 students must be arranged into groups of",
        F"""4 for group projects, there are {combinations(40, 4)} ways""",
        "to arrange them.\n",
    )

    print(
        "If 10 teams are competing in a Formula One race, there",
        F"""are {combinations(10, 3)} ways that first, second and""",
        "third place can be awarded.",
    )





def 						A__  (					__A	):







    '''simple docstring'''
    _lowerCamelCase     :		Tuple 						=						0
    for ch in input_str:
        _lowerCamelCase     :		Optional[Any] 						=						ord(__A	)
        _lowerCamelCase     :		List[str] 						=						pow(2   , __A	)

        # If we already turned on bit for current character's unicode
        if bitmap >> ch_unicode & 1 == 1:
            return False
        bitmap |= ch_bit_index_on
    return True


if __name__ == "__main__":
    import doctest

    doctest.testmod()




