## Sets

Let $A$ be a set having $2n$ elements. Find the least possible value for $k$ such that there exist different subsets $A_1,...,A_k \subset A$, having $n$ elements each, such that for any two elements of $A$ there exists $A_j$ such that $A_j$ contains one of them and does not contain the second one.