INMO 2014 Problem 6

Let $n$ be a natural number and $X=\{1,2, \ldots, n\}$. For subsets $A$ and $B$ of $X$ we define $A \Delta B$ to be the set of all those elements of $X$ which belong to exactly one of $A$ and $B$. Let $\mathcal{F}$ be a collection of subsets of $X$ such that for any two distinct elements $A$ and $B$ in $\mathcal{F}$ the set $A \Delta B$ has at least two elements. Show that $\mathcal{F}$ has at most $2^{n-1}$ elements. Find all such collections $\mathcal{F}$ with $2^{n-1}$ elements.