def find_n_kickers(cards, used, n):
    """
    Finds the top n kickers that are not already used.

    Args:
        cards(list(str)): A list of card strings sorted by ordinal value.
        used(set(str)): A set of strings that have been used.
        n(int): The number of cards to find.

    Returns:
        list(str): A list with the top n cards that are not used.
    """

    kickers = []

    # Start with the highest to lowest cards.
    for card in cards:
        # If the card has already been used, skip it.
        if card in used:
            continue

        # Add the card.
        kickers.append(card)

        # If we hit the desired amount, stop.
        if len(kickers) == n:
            return kickers