import numpy as np

def how_with_plus(matrix):
    count = 0
    for i in range(len(matrix)):
        positive = 0
        for j in range(len(matrix[0])):
            if matrix[i][j] > 0:
                positive += 1
        if positive >= 3:
            count += 1
    return count

A = np.array([[0, 9, 5, 0, 0, 2], [8, 5, 3, -5, 1, 4], [2, -1, 6, -3, 0, 1], [5, -5, -2, 5, 1, 0]])
size_f_goal = len(A[0]) - 1
min_colm = 1
min_f_goal = A[0][min_colm]
for i in range(size_f_goal):
    if A[0][i] < min_f_goal:
        min_f_goal = A[0][i]
        min_colm = i
size_b = how_with_plus(A)
min_line = 1
min_a = A[min_line][min_colm]
while min_a == 0:
    min_line += 1
    min_a = A[min_line][min_colm]
min_koef = A[min_line][0] / min_a
for i in range(size_b):
    if A[i][min_colm] != 0:
        new_min_koef = A[i][0] / A[i][min_colm]
        if new_min_koef < min_koef:
            min_koef = new_min_koef
            min_line = i
for i in range(size_b):
    A[i][min_line] = A[i][min_colm]