Opposite Attract

You are given a binary string $S$ of length $N$. Your task is to generate a new binary string $T$ of the same length such that each corresponding character of $T$ is different from the character at the same position in $S$. In other words, for each position $i$ ($0 ≤ i < N$), the following condition must hold $T_i ≠ S_i$. ### Input - The first line of input will contain a single integer $T$, den