




from __future__ import annotations




def        __SCREAMING_SNAKE_CASE (	lowercase_       ,  lowercase_   )							->						str:

    """simple docstring"""


    __UpperCamelCase			=    0
    __UpperCamelCase			=    len(lowercase_   ) - 1
    while left <= right:
        __UpperCamelCase			=    (left + right) // 2
        if left == right:
            if sorted_list[middle] < item:
                __UpperCamelCase			=    middle + 1
            break
        elif sorted_list[middle] < item:
            __UpperCamelCase			=    middle + 1
        else:
            __UpperCamelCase			=    middle - 1
    sorted_list.insert(lowercase_       ,  lowercase_   )
    return sorted_list




def        __SCREAMING_SNAKE_CASE (	lowercase_       ,  lowercase_   )							->						int:

    """simple docstring"""


    __UpperCamelCase			=    []
    while left and right:
        if left[0][0] < right[0][0]:
            result.append(left.pop(0   )   )
        else:
            result.append(right.pop(0   )   )
    return result + left + right




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						str:

    """simple docstring"""


    __UpperCamelCase			=    len(lowercase_   )
    if length <= 1:
        return list_ad
    __UpperCamelCase			=    length // 2
    return merge(sortlist_ad(list_ad[:middle]   )       ,  sortlist_ad(list_ad[middle:]   )   )




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						list[int]:

    """simple docstring"""


    if len(lowercase_   ) <= 1:
        return collection
    __UpperCamelCase			=    []
    __UpperCamelCase			=    False
    for i in range(0       ,  len(lowercase_   )       ,  2   ):
        if i == len(lowercase_   ) - 1:
            __UpperCamelCase			=    True
        else:
            if collection[i] < collection[i + 1]:
                two_paired_list.append([collection[i], collection[i + 1]]   )
            else:
                two_paired_list.append([collection[i + 1], collection[i]]   )
    __UpperCamelCase			=    sortlist_ad(lowercase_   )
    __UpperCamelCase			=    [i[0] for i in sorted_list_ad]
    result.append(sorted_list_ad[-1][1]   )
    if has_last_odd_item:
        __UpperCamelCase			=    collection[-1]
        __UpperCamelCase			=    binary_search_insertion(lowercase_       ,  lowercase_   )
    __UpperCamelCase			=    False
    for i in range(len(lowercase_   ) - 1   ):
        if result[i] == collection[-1] and has_last_odd_item:
            __UpperCamelCase			=    True
        __UpperCamelCase			=    sorted_list_ad[i][1]
        # If last_odd_item is inserted before the item's index,
        # you should forward index one more.
        if is_last_odd_item_inserted_before_this_index:
            __UpperCamelCase			=    result[: i + 2] + binary_search_insertion(result[i + 2 :]       ,  lowercase_   )
        else:
            __UpperCamelCase			=    result[: i + 1] + binary_search_insertion(result[i + 1 :]       ,  lowercase_   )

    return result


if __name__ == "__main__":
 a_ 		=  input("Enter numbers separated by a comma:\n").strip()
 a_ 		=  [int(item) for item in user_input.split(",")]
 print(merge_insertion_sort(unsorted))








'''simple docstring'''
from __future__ import annotations

import os






class  UpperCAmelCase_					:
 UpperCAmelCase_		     =    (
     """High card""",
     """One pair""",
     """Two pairs""",
     """Three of a kind""",
     """Straight""",
     """Flush""",
     """Full house""",
     """Four of a kind""",
     """Straight flush""",
     """Royal flush""",
 )

 UpperCAmelCase_		     =    (
     """""",  # placeholder as tuples are zero-indexed
     """One""",
     """Two""",
     """Three""",
     """Four""",
     """Five""",
     """Six""",
     """Seven""",
     """Eight""",
     """Nine""",
     """Ten""",
     """Jack""",
     """Queen""",
     """King""",
     """Ace""",
 )





 def __init__(     self			,							lowercase_):
     if not isinstance(lowercase_			,							lowercase_):
         snake_case_			:     Union[str, Any]        =    F'Hand should be of type \'str\': {hand!r}'
         raise TypeError(lowercase_)
     # split removes duplicate whitespaces so no need of strip
     if len(hand.split(" ")) != 5:
         snake_case_			:     Optional[int]        =    F'Hand should contain only 5 cards: {hand!r}'
         raise ValueError(lowercase_)
     snake_case_			:     str        =    hand
     snake_case_			:     str        =    0
     snake_case_			:     List[str]        =    0
     snake_case_      ,			snake_case_			:     Union[str, Any]        =    self._internal_state()
     snake_case_			:     List[Any]        =    self._get_hand_type()
     snake_case_			:     Optional[int]        =    self._card_values[0]





 @property
 def 							snake_case__		(     self):
     return self._hand





 def 							snake_case__		(     self			,							lowercase_):
     # Breaking the tie works on the following order of precedence:
     # 1. First pair (default 0)
     # 2. Second pair (default 0)
     # 3. Compare all cards in reverse order because they are sorted.

     # First pair and second pair will only be a non-zero value if the card
     # type is either from the following:
     # 21: Four of a kind
     # 20: Full house
     # 17: Three of a kind
     # 16: Two pairs
     # 15: One pair
     if self._hand_type > other._hand_type:
         return "Win"
     elif self._hand_type < other._hand_type:
         return "Loss"
     elif self._first_pair == other._first_pair:
         if self._second_pair == other._second_pair:
             return self._compare_cards(lowercase_)
         else:
             return "Win" if self._second_pair > other._second_pair else "Loss"
     return "Win" if self._first_pair > other._first_pair else "Loss"





 def 							snake_case__		(     self):
     snake_case_			:     Tuple        =    PokerHand._HAND_NAME[self._hand_type - 14]
     snake_case_			:     List[Any]        =    PokerHand._CARD_NAME[self._high_card]
     snake_case_			:     Any        =    PokerHand._CARD_NAME[self._first_pair]
     snake_case_			:     str        =    PokerHand._CARD_NAME[self._second_pair]
     if self._hand_type in [22, 19, 18]:
         return name + F', {high}-high'
     elif self._hand_type in [21, 17, 15]:
         return name + F', {paira}s'
     elif self._hand_type in [20, 16]:
         snake_case_			:     List[str]        =    "over" if self._hand_type == 20 else "and"
         return name + F', {paira}s {join} {paira}s'
     elif self._hand_type == 23:
         return name
     else:
         return name + F', {high}'





 def 							snake_case__		(     self			,							lowercase_):
     # Enumerate gives us the index as well as the element of a list
     for index, card_value in enumerate(self._card_values):
         if card_value != other._card_values[index]:
             return "Win" if card_value > other._card_values[index] else "Loss"
     return "Tie"





 def 							snake_case__		(     self):
     # Number representing the type of hand internally:
     # 23: Royal flush
     # 22: Straight flush
     # 21: Four of a kind
     # 20: Full house
     # 19: Flush
     # 18: Straight
     # 17: Three of a kind
     # 16: Two pairs
     # 15: One pair
     # 14: High card
     if self._is_flush():
         if self._is_five_high_straight() or self._is_straight():
             return 23 if sum(self._card_values) == 60 else 22
         return 19
     elif self._is_five_high_straight() or self._is_straight():
         return 18
     return 14 + self._is_same_kind()





 def 							snake_case__		(     self):
     return len(self._card_suit) == 1





 def 							snake_case__		(     self):
     # If a card is a five high straight (low ace) change the location of
     # ace from the start of the list to the end. Check whether the first
     # element is ace or not. (Don't want to change again)
     # Five high straight (low ace): AH 2H 3S 4C 5D
     # Why use sorted here? One call to this function will mutate the list to
     # [5, 4, 3, 2, 14] and so for subsequent calls (which will be rare) we
     # need to compare the sorted version.
     # Refer test_multiple_calls_five_high_straight in test_poker_hand.py
     if sorted(self._card_values) == [2, 3, 4, 5, 14]:
         if self._card_values[0] == 14:
             # Remember, our list is sorted in reverse order
             snake_case_			:     Optional[int]        =    self._card_values.pop(0)
             self._card_values.append(lowercase_)
         return True
     return False





 def 							snake_case__		(     self):
     for i in range(4):
         if self._card_values[i] - self._card_values[i + 1] != 1:
             return False
     return True





 def 							snake_case__		(     self):
     # Kind Values for internal use:
     # 7: Four of a kind
     # 6: Full house
     # 3: Three of a kind
     # 2: Two pairs
     # 1: One pair
     # 0: False
     snake_case_			:     Dict        =    0
     for i in range(4):
         # Compare two cards at a time, if they are same increase 'kind',
         # add the value of the card to val1, if it is repeating again we
         # will add 2 to 'kind' as there are now 3 cards with same value.
         # If we get card of different value than val1, we will do the same
         # thing with val2
         if self._card_values[i] == self._card_values[i + 1]:
             if not vala:
                 snake_case_			:     Tuple        =    self._card_values[i]
                 kind += 1
             elif vala == self._card_values[i]:
                 kind += 2
             elif not vala:
                 snake_case_			:     Optional[int]        =    self._card_values[i]
                 kind += 1
             elif vala == self._card_values[i]:
                 kind += 2
        # For consistency in hand type (look at note in _get_hand_type function)
     snake_case_			:     Dict        =    kind + 2 if kind in [4, 5] else kind
     # first meaning first pair to compare in 'compare_with'
     snake_case_			:     Union[str, Any]        =    max(lowercase_			,							lowercase_)
     snake_case_			:     Optional[Any]        =    min(lowercase_			,							lowercase_)
     # If it's full house (three count pair + two count pair), make sure
     # first pair is three count and if not then switch them both.
     if kind == 6 and self._card_values.count(lowercase_) != 3:
         snake_case_      ,			snake_case_			:     Dict        =    second, first
     snake_case_			:     Optional[int]        =    first
     snake_case_			:     Dict        =    second
     return kind





 def 							snake_case__		(     self):
     # Internal representation of hand as a list of card values and
     # a set of card suit
     snake_case_			:     dict        =    {"T": "10", "J": "11", "Q": "12", "K": "13", "A": "14"}
     snake_case_			:     Tuple        =    self._hand.translate(str.maketrans(lowercase_)).split()
     snake_case_			:     Dict        =    [int(card[:-1]) for card in new_hand]
     snake_case_			:     Tuple        =    {card[-1] for card in new_hand}
     return sorted(lowercase_			,							reverse=lowercase_), card_suit





 def __repr__(     self):
     return F'{self.__class__}("{self._hand}")'





 def __str__(     self):
     return self._hand





 def __eq__(     self			,							lowercase_):
     if isinstance(lowercase_			,							lowercase_):
         return self.compare_with(lowercase_) == "Tie"
     return NotImplemented





 def __lt__(     self			,							lowercase_):
     if isinstance(lowercase_			,							lowercase_):
         return self.compare_with(lowercase_) == "Loss"
     return NotImplemented





 def __le__(     self			,							lowercase_):
     if isinstance(lowercase_			,							lowercase_):
         return self < other or self == other
     return NotImplemented





 def __gt__(     self			,							lowercase_):
     if isinstance(lowercase_			,							lowercase_):
         return not self < other and self != other
     return NotImplemented





 def __ge__(     self			,							lowercase_):
     if isinstance(lowercase_			,							lowercase_):
         return not self < other
     return NotImplemented





 def __hash__(     self):
     return object.__hash__(self)


def     UpperCamelCase_  (						):
    """simple docstring"""






    snake_case_			:     Dict        =    0
    snake_case_			:     Tuple        =    os.path.abspath(os.path.dirname(__SCREAMING_SNAKE_CASE							)							)
    snake_case_			:     List[Any]        =    os.path.join(__SCREAMING_SNAKE_CASE,		"poker_hands.txt"							)
    with open(__SCREAMING_SNAKE_CASE							) as file_hand:
        for line in file_hand:
            snake_case_			:     int        =    line[:1_4].strip()
            snake_case_			:     Optional[Any]        =    line[1_5:].strip()
            snake_case_      ,			snake_case_			:     Union[str, Any]        =    PokerHand(__SCREAMING_SNAKE_CASE							), PokerHand(__SCREAMING_SNAKE_CASE							)
            snake_case_			:     Optional[int]        =    player.compare_with(__SCREAMING_SNAKE_CASE							)
            if output == "Win":
                answer += 1
    return answer


if __name__ == "__main__":
  solution()




