KöMaL 2007 A423

Find all positive integers $n$ for which the numbers $1,2,3,\ldots,2n$ can be colored with $n$colors such that each color is used exactly twice and each of the numbers $1,2,\ldots,n$ appear exactly once as the difference between two numbers with the same color.