What is the maximal possible value of n such that no matter how 25 squares are selected in an infinite chessboard one can find n squares in which none of them share a common corner?<spanclass=′latex−bold′>(A)</span>7<spanclass=′latex−bold′>(B)</span>8<spanclass=′latex−bold′>(C)</span>9<spanclass=′latex−bold′>(D)</span>10<spanclass=′latex−bold′>(E)</span>11