In chess, a knight moves either two squares vertically and one square horizontally, or two squares horizontally and one square vertically in each move. Suppose a knight can visit every squares on a $4\times n$ chessboard exactly once without repeating. Find all the possible values of $n$.