Recall that a subsequence of a string is any string obtained by removing some subset of characters from the string, for instance “string”, “sing”, “i” and “sg” are all subsequences of “string”. If the same subsequence can be obtained in exactly $t$ different ways, by removing different subsets of characters, we say that the subsequence occurs $t$ times. 

Jingfei wants to create a nonempty bit string that has the following properties:
 - the subsequence 00 occurs $a$ times,
 - the subsequence 01 occurs $b$ times,
 - the subsequence 10 occurs $c$ times, and
 - the subsequence 11 occurs $d$ times.

However, Jingfei does not know how to create such a string – or whether it is even possible. Could you help her?

-----Input-----
The input consists of a single line with four integers $a$, $b$, $c$, and $d$ ($0 \leq a,b,c,d \leq 10^9$).

-----Output-----
Output a bit string that satisfies the given requirements. If there are several solutions, output any one of them. If there are no solutions, output “impossible”.

-----Examples-----
Sample Input:
3 4 2 1
Sample Output:
01001

Difficulty: competition

Starter code:

Solutions: