Binary Flipping (Easy)

**This is the easy version of the problem. In this version, $N \le 100$.** For a binary array $S$ of length $N$, define $f(S)$ in the following way: - Consider performing operations as follows: - Choose index $i$ such that $1 \le i \le N - 2$ and $S_i = S_{i + 2}$ - Flip the value of $S_{i + 1}$, i.e. $0$ to $1$ or vice versa. - $f(S)$ is the number of arrays reachable by the use of seve