You are given a string $s$ of length $2n$, which consists only of zeros and ones. At the beginning, all the characters are colored in black. You can choose any $n$ characters from the string and color them in red.

After that, you form two new strings, the first one is the characters colored in black, and the second one is the characters colored in red. Note that both resulting strings have a length of $n$.

Your task is to determine whether it is possible to color in such a way that the resulting two strings differ in each position.