Given a natural number *x* > 0 with *n* bits,
we denote with *x*_{n−1}… *x*_{0} its representation in base 2.
For example, *x* = 8 in base 2 is 1000,
so *x*_{3} = 1 and *x*_{2} = *x*_{1} = *x*_{0} = 0.

Write a program to mix the base 2 representations
of two given natural numbers *x* and *y* with the same number of bits *n*.
That is, print *x*_{n−1} *y*_{n−1} … *x*_{0} *y*_{0}.

**Input**

Input consists of several cases, each with two natural numbers with the same number of bits, between 1 and 30.

**Output**

For every case, print the mixing of the representations in base 2 of the two numbers.

Public test cases

**Input**

8 15 1 1 2 3 1000 600 900000 1000000

**Output**

11010101 11 1101 11101011100111000000 1111011110011010100011101001100000000000

Information

- Author
- Salvador Roura
- Language
- English
- Translator
- Salvador Roura
- Original language
- Catalan
- Other languages
- Catalan
- Official solutions
- C++ Java Python
- User solutions
- C C++ Python