In a 5*5 square table, each small square is filled with a number, and the numbers in each row and column of the table form an arithmetic progression. It is known that n squares are randomly selected, as long as the numbers in these squares are known, the square table can be filled completely. Then, what is the minimum value of n?
一个5*5的方格表中，每个小方格内填有一个数，并且表中的每一行、每一列的数都构成等差数列．已知任取n个方格，只要知道了这些方格中的数，就可以把方格表补填完整，那么，n的最小值是多少？
<gadget id="calculator">1 + 2</gadget>
<output>3</output>

<result>3</result>