The problem is about counting the number of strings of size $$$n$$$ consisting of $$$'a'$$$ and $$$'b'$$$ such that for any substring of the string, the absolute difference between the number of
Unable to parse markup [type=CF_MATHJAX]
'b'Unable to parse markup [type=CF_MATHJAX]
.