


from math import ceil
def      _a					( SCREAMING_SNAKE_CASE = 10_01	):


		"""simple docstring"""




		lowercase__				= 1

		for i in range(1		,							int(ceil(n / 2.0	)	)	):
				lowercase__				= 2 * i + 1
				lowercase__				= 2 * i
				lowercase__				= total + 4 * odd**2 - 6 * even

		return total


if __name__ == "__main__":
			import sys

			if len(sys.argv) == 1:
						print(solution())
			else:
						try:
									lowerCAmelCase			=				int(sys.argv[1])
									print(solution(n))
						except ValueError:
									print('Invalid entry - please enter a number')










"""simple docstring"""





def 	lowerCamelCase__			(				_lowerCamelCase			:						list[list[int | float]]					) ->							int:
  lowerCamelCase_       	=		len(_lowerCamelCase					)
  lowerCamelCase_       	=		len(matrix[0]					)
  lowerCamelCase_       	=		min(_lowerCamelCase						,							_lowerCamelCase					)

  for row in range(_lowerCamelCase					):
    # Check if diagonal element is not zero
    if matrix[row][row] != 0:
      # Eliminate all the elements below the diagonal
      for col in range(row + 1						,							_lowerCamelCase					):
        lowerCamelCase_       	=		matrix[col][row] / matrix[row][row]
        for i in range(_lowerCamelCase						,							_lowerCamelCase					):
          matrix[col][i] -= multiplier * matrix[row][i]
    else:
      # Find a non-zero diagonal element to swap rows
      lowerCamelCase_       	=		True
      for i in range(row + 1						,							_lowerCamelCase					):
        if matrix[i][row] != 0:
          lowerCamelCase_	,      lowerCamelCase_       	=		matrix[i], matrix[row]
          lowerCamelCase_       	=		False
          break
      if reduce:
        rank -= 1
        for i in range(_lowerCamelCase					):
          lowerCamelCase_       	=		matrix[i][rank]

            # Reduce the row pointer by one to stay on the same row
      row -= 1

  return rank


if __name__ == "__main__":
  import doctest

  doctest.testmod()




