




'''simple docstring'''





def UpperCAmelCase    (       UpperCAmelCase_						):
    # must be
    _a				:							Optional[Any]							       =      [list(UpperCAmelCase_						) for row in matrix]
    if matrix and isinstance(UpperCAmelCase_   ,	UpperCAmelCase_						):
        if isinstance(matrix[0]   ,	UpperCAmelCase_						):
            _a				:							int							       =      0
            for row in matrix:
                if prev_len == 0:
                    _a				:							Any							       =      len(UpperCAmelCase_						)
                    _a				:							Optional[Any]							       =      True
                else:
                    _a				:							List[Any]							       =      prev_len == len(UpperCAmelCase_						)
        else:
            _a				:							Dict							       =      True
    else:
        _a				:							Dict							       =      False

    return result





def UpperCAmelCase    (       UpperCAmelCase_						):
    if check_matrix(UpperCAmelCase_						) and len(UpperCAmelCase_						) > 0:
        _a				:							Tuple							       =      [list(UpperCAmelCase_						) for row in a]
        _a				:							Union[str, Any]							       =      len(UpperCAmelCase_						)
        if isinstance(a[0]   ,	UpperCAmelCase_						):
            _a				:							Union[str, Any]							       =      len(a[0]						)
        else:
            for dat in a:
                print(UpperCAmelCase_						)
            return

        # horizotal printing increasing
        for i in range(0   ,	UpperCAmelCase_						):
            print(a[0][i]						)
        # vertical printing down
        for i in range(1   ,	UpperCAmelCase_						):
            print(a[i][mat_col - 1]						)
        # horizotal printing decreasing
        if mat_row > 1:
            for i in range(mat_col - 2   ,	-1   ,	-1						):
                print(a[mat_row - 1][i]						)
        # vertical printing up
        for i in range(mat_row - 2   ,	0   ,	-1						):
            print(a[i][0]						)
        _a				:							List[str]							       =      [row[1 : mat_col - 1] for row in a[1 : mat_row - 1]]
        if len(UpperCAmelCase_						) > 0:
            spiral_print_clockwise(UpperCAmelCase_						)
        else:
            return
    else:
        print("""Not a valid matrix"""						)
        return





def UpperCAmelCase    (       UpperCAmelCase_						):
    if matrix:
        return list(matrix.pop(0						)						) + spiral_traversal(list(zip(*UpperCAmelCase_						)						)[::-1]						)
    else:
        return []


# driver code
if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a		:	str       =      [[1, 2, 3, 4], [5, 6, 7, 8], [9, 1_0, 1_1, 1_2]]
  spiral_print_clockwise(a)




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






    if number != int(__SCREAMING_SNAKE_CASE							):
        raise ValueError("factorial() only accepts integral values"							)
    if number < 0:
        raise ValueError("factorial() not defined for negative values"							)
    snake_case_			:     int        =    1
    for i in range(1,		number + 1							):
        value *= i
    return value

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






    if not isinstance(__SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							):
        raise ValueError("factorial() only accepts integral values"							)
    if n < 0:
        raise ValueError("factorial() not defined for negative values"							)
    return 1 if n == 0 or n == 1 else n * factorial(n - 1							)


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a_           =    int(input("Enter a positive integer: ").strip() or 0)
  print(f"""factorial{n} is {factorial(n)}""")




