OMM 2006 Problem 3

Let $n$ be an integer greater than $1$ . In how many ways can we fill all the numbers $1, 2,..., 2n$ in the boxes of a grid of $2\times n$ , one in each box, so that any two consecutive numbers are they in squares that share one side of the grid?