






"""simple docstring"""





_SCREAMING_SNAKE_CASE   :							List[str]          =		{str(digit): digit**5 for digit in range(10)}







def 	lowerCamelCase__			(				_lowerCamelCase			:						int					) ->							int:
  return sum(DIGITS_FIFTH_POWER[digit] for digit in str(_lowerCamelCase					)					)







def 	lowerCamelCase__			(				) ->							int:
  return sum(
      number
      for number in range(1000						,							1000000					)
      if number == digits_fifth_powers_sum(_lowerCamelCase					)					)


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












"""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()




