Mixing in base 2

Given a natural number $x > 0$ with $n$ bits, we denote with $x_{n-1}\dots 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} \dots 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.

Problem information

Author: Unknown
Translator: Salvador Roura

Generation: 2026-01-25T11:09:36.562Z