Let n(≥2) be a positive integer. Find the minimum m, so that there exists xij(1≤i,j≤n) satisfying:
(1)For every 1≤i,j≤n,xij=max{xi1,xi2,...,xij} or xij=max{x1j,x2j,...,xij}.
(2)For every 1≤i≤n, there are at most m indices k with xik=max{xi1,xi2,...,xik}.
(3)For every 1≤j≤n, there are at most m indices k with xkj=max{x1j,x2j,...,xkj}.