Chef Loves Beautiful Strings (Easy Version)

**This is the easy version of the problem. Here, you only need to compute $f(S)$ for the given binary string $S$.** The *beauty* of a **binary** string $T$, denoted $f(T)$, is defined as follows. Consider the following algorithm ($T$ is $1$-indexed). - Let $\text{score} = 0$. - Repeat the following $|T|-1$ times: - Choose an index $i$ ($1 \leq i \leq |T|$), delete $T_i$ from the string, and