Dull Operation

*Be afraid, be very afraid.* On Halloween, Chef is in a somber mood. Chef has an **odd** integer $N$ that he has to decode. To do so, Chef would like to find a pair of integers $x$ and $y$ ($0 \leq x, y \lt 2^{30}$) such that: $$ (x\mid y) \cdot (x\oplus y) = N $$ Help Chef find **any** such pair! It can be proved that a valid pair always exists. Here, $\mid$ represents the [bitwise OR]