


from __future__ import annotations



def UpperCamelCase_				(				__a      )	->   int:

      # preprocessing the first row
      for i in range(1			,				len(matrix[0]      )      ):
            matrix[0][i] += matrix[0][i - 1]

      # preprocessing the first column
      for i in range(1			,				len(__a      )      ):
            matrix[i][0] += matrix[i - 1][0]

      # updating the path cost for current position
      for i in range(1			,				len(__a      )      ):
            for j in range(1			,				len(matrix[0]      )      ):
                  matrix[i][j] += min(matrix[i - 1][j]			,				matrix[i][j - 1]      )

      return matrix[-1][-1]


if __name__ == "__main__":
    import doctest

    doctest.testmod()







def 				A__ (snake_case   :		int				)     ->						bool:
					if number < 0:
										raise ValueError("""number must not be negative"""				)
					return number & (number - 1) == 0


if __name__ == "__main__":
	import doctest

	doctest.testmod()






