It is very easy to see that $4\leq n\leq6$. Indeed we have $n\geq4$ because
$$|(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})|=8>|S_3|,$$
and we have $n\leq6$ because $S_6$ contains the subgroup generated by $(1\ 2)$, $(3\ 4)$ and $(5\ 6)$, which is isomorphic to $(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})$.
Now for some more structured observations assuming only the most elementary knowledge of group theory:
The first thing to note is that the order of every nontrivial element of $(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})$ is $2$. Expressing elements of $S_n$ as products of disjoint cycles, we see that an element has order at most $2$ if and only if it is a nontrivial product of disjoint transpositions.
The next thing to note is that
$(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})\times(\Bbb{Z}/2\Bbb{Z})$ is abelian. So it remains to determine whether we can find $7$ products of disjoint transpositions in $S_n$ that commute with eachother.
We can simply list the elements. In $S_4$ these are
$$(1\ 2),\quad (1\ 3),\quad (1\ 4),\quad (2\ 3),\quad (2\ 4),\quad (3\ 4),\quad (1\ 2)(3\ 4),\quad (1\ 3)(2\ 4),\quad (1\ 4)(2\ 3).$$
A quick check shows that each of these commutes with only $2$ others. This shows that $n>4$.
We can do the same in $S_5$; a quick check shows that only
$$(1\ 2),\quad (3\ 4),\quad (3\ 5),\quad (4\ 5),\quad (1\ 2)(3\ 4),\quad (1\ 2)(3\ 5),\quad (1\ 2)(4\ 5),$$
commute with $(1\ 2)$, but not all $7$ elements commute with eachother. By symmetry this shows that such a subgroup cannot contain any transpositions. A further check among the products of $2$ disjoint transpositions shows that only
$$(1\ 2)(3\ 4),\quad (1\ 2)(3\ 5),\quad (1\ 2)(4\ 5),\quad (1\ 5)(3\ 4),\quad (2\ 5)(3\ 4),$$
commute with $(1\ 2)(3\ 4)$, so by symmetry such a subgroup doesn't contain any products of disjoint transpositions either. Then no such subgroup exists, so $n>5$.