def find_saddle_point(matrix): n = len(matrix) # 矩阵的大小 saddle_point = None # 遍历每一行，找出最大值的索引 for i in range(n): max_in_row = max(matrix[i]) max_index_in_row = matrix[i].index(max_in_row) # 检查这一行的最大值是否也是所在列的最小值 min_in_column = min([matrix[j][max_index_in_row] for j in range(n)]) if max_in_row == min_in_column: saddle_point = (i, max_index_in_row, max_in_row) break return saddle_point # 读取输入 matrix = [] for _ in range(5): row = list(map(int, input().split())) matrix.append(row) # 调用函数并打印输出 saddle_point = find_saddle_point(matrix) if saddle_point: print(saddle_point[0] + 1, saddle_point[1] + 1, saddle_point[2]) else: print("not found")