Two players are playing a turn based game on a n×n chessboard. At the beginning, only the bottom left corner of the chessboard contains a piece. At each turn, the player moves the piece to either the square just above, or the square just right, or the diagonal square just right-top. If a player cannot make a move, he loses the game. The game is played once on each 6×7, 6×8, 7×7, 7×8, and 8×8 chessboard. In how many of them, can the first player guarantee to win?<spanclass=′latex−bold′>(A)</span>1<spanclass=′latex−bold′>(B)</span>2<spanclass=′latex−bold′>(C)</span>3<spanclass=′latex−bold′>(D)</span>4<spanclass=′latex−bold′>(E)</span>None