Minimum Longest Substring

You are given a binary string $A$ of length $N$. Rearrange the binary string to form binary strings $S$ and $T$ such that the length of the [longest common substring](https://en.wikipedia.org/wiki/Longest_common_substring_problem) between $S$ and $T$ is **minimum**. Print both strings $S$ and $T$. **Note** that both $S$ and $T$ must be anagrams of $A$ — see the examples below for more clarity.