Matrix Saddle Points

Problem Statement

\n Matrix Saddle Points \n \n \n You are given integers your task is to search for the \"saddle points\" in an N×N array of integers. A saddle point is a cell whose value is greater than or equal to any other cell in its row, and less than or equal to any other cell in its column. There may be more than one saddle point in the array. \n \n \n \n Input Format \n \n The first and second lines are integers N, denoting the size of the square matrix. \n The next N lines, we have the N x N square matrix with space-separated integers. \n \n \n \n \n Output Format \n \n If there are saddle points, return their coordinates in ascending order, formatted as (row,column) (1-based indexing). \n If there are no saddle points, return -1. \n \n \n \n \n Constraints \n \n 1 ≤ N ≤ 10 (Size of the matrix) \n 1 ≤ element of matrix ≤ 100 (Value of elements in the matrix) \n \n \n \n \n Sample Test Cases \n \n \n Sample Input 1: \n 5\n5\n8 9 11 12 3\n10 11 12 13 4\n22 23 24 25 5\n26 27 28 29 10 \n \n Sample