NUMERICAL
For $n \geq 2$, let $S_n$ denote the set of all subsets of $\{1,2, \ldots, n\}$ with no two consecutive numbers. For example $\{1,3,5\} \in S_6$, but $\{1,2,4\} \notin S_6$. Then $n\left(S_5\right)$ is equal to ________
NUMERICAL
Let $A=\{1,2,3,4\}$ and $R=\{(1,2),(2,3),(1,4)\}$ be a relation on $\mathrm{A}$. Let $\mathrm{S}$ be the equivalence relation on $\mathrm{A}$ such that $R \subset S$ and the number of elements in $\mathrm{S}$ is $\mathrm{n}$. Then, the minimum value of $n$ is __________.