Max count of 1

You are given a **binary** string $S$ of length $N$. You have to construct a binary string $X$, of length $N$, such that: - For each $(1\le i \lt N)$, $X_{(i+1)} = (X_i \oplus S_i)$, where $\oplus$ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR); - The count of $1$s in the string $X$ is **maximised**. Find the **maximum** count of $1$ in string $X$. ##