Question 194
Find a long binary word containing a small number of square subwords. Specifically, write down a binary word of any length $n \leq 50$. Your score will be $\max \{0, n-s\}$, where $s$ is the number of occurrences of square subwords. (That is, each different square subword will be counted according to the number of times it appears.)