Or Permutation

Chef has a sequence $A$ of $N$ integers. He picked a **non-negative** integer $X$ and obtained another sequence $B$ of $N$ integers, defined as $B_i = A_i \mid X$ for each $1 \leq i \leq N$. Unfortunately, he forgot $X$, and the sequence $B$ got jumbled. Chef wonders what the value of $X$ is. He gives you the sequence $A$ and the jumbled sequence $B$. Your task is to find whether there is a non-