


"""simple docstring"""



__snake_case   			=    {}







def   __lowerCAmelCase						(						lowercase  :  int						,							lowercase  :  int						,							lowercase  :  int )	->						int:


    """simple docstring"""





    if late == 3 or absent == 2:
        return 0

    # if we have no days left, and have not failed any other rules,
    # we have a prize string
    if days == 0:
        return 1

    # No easy solution, so now we need to do the recursive calculation

    # First, check if the combination is already in the cache, and
    # if yes, return the stored value from there since we already
    # know the number of possible prize strings from this point on
    snake_case    :      Dict      					=    (days, absent, late)
    if key in cache:
        return cache[key]

    # now we calculate the three possible ways that can unfold from
    # this point on, depending on our attendance today

    # 1) if we are late (but not absent), the "absent" counter stays as
    # it is, but the "late" counter increases by one
    snake_case    :      int      					=    _calculate(days - 1						,							lowercase						,							late + 1 )

    # 2) if we are absent, the "absent" counter increases by 1, and the
    # "late" counter resets to 0
    snake_case    :      Dict      					=    _calculate(days - 1						,							absent + 1						,							0 )

    # 3) if we are on time, this resets the "late" counter and keeps the
    # absent counter
    snake_case    :      Optional[int]      					=    _calculate(days - 1						,							lowercase						,							0 )

    snake_case    :      List[Any]      					=    state_late + state_absent + state_ontime

    snake_case    :      Any      					=    prizestrings
    return prizestrings







def   __lowerCAmelCase						(						lowercase  :  int = 30 )	->						int:


    """simple docstring"""





    return _calculate(lowercase						,							absent=0						,							late=0 )


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









"""simple docstring"""



def   __lowerCAmelCase						(						lowercase  :  Union[str, Any] )	->						List[str]:


    """simple docstring"""





    snake_case    :      List[str]      					=    len(lowercase )
    for i in range(length - 1 ):
        snake_case    :      List[str]      					=    i
        for k in range(i + 1						,							lowercase ):
            if collection[k] < collection[least]:
                snake_case    :      List[str]      					=    k
        if least != i:
            snake_case					,snake_case    :      Union[str, Any]      					=    (collection[i], collection[least])
    return collection


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





