IR-TST 2013 Problem 2

Find the maximum number of subsets from $\left \{ 1,...,n \right \}$ such that for any two of them like $A,B$ if $A\subset B$ then $\left | B-A \right |\geq 3$ . (Here $\left | X \right |$ is the number of elements of the set $X$ .)