on 2D plane place n stone integer coordinate point each coordinate point stoneA stone remove share row column stone removedGiven array stone length n stonesi xi yi represent location ith stone return large possible number stone remove example 1input stone 000110122122output 5explanation one way remove 5 stone follows1 remove stone 22 share row 212 Remove stone 21 share column 013 remove stone 12 share row 104 Remove stone 10 share column 005 remove stone 01 share row 00stone 00 remove share rowcolumn stone planeexample 2input stone 0002112022output 3explanation one way 3 move follows1 remove stone 22 share row 202 remove stone 20 share column 003 Remove stone 02 share row 00stone 00 11 remove share rowcolumn stone planeexample 3input stone 00output 0explanation 00 stone plane remove Constraints1 stoneslength 10000 xi yi 104No stone coordinate point