CN-SMO 2005 Problem 3

Let $n$ be positive integer, set $M = \{ 1, 2, \ldots, 2n \}$ . Find the minimum positive integer $k$ such that for any subset $A$ (with $k$ elements) of set $M$ , there exist four pairwise distinct elements in $A$ whose sum is $4n + 1$ .