VMO 2009 Problem 5

Let $S =\{1,2,3, \ldots, 2n\}$ ( $n \in \mathbb{Z}^+$ ). Ddetermine the number of subsets $T$ of $S$ such that there are no 2 element in $T$ $a,b$ such that $|a-b|=\{1,n\}$