RS-SMO 2016 Problem 5

There are $2n-1$ twoelement subsets of set $1,2,...,n$ . Prove that one can choose $n$ out of these such that their union contains no more than $\frac{2}{3}n+1$ elements.