Bitwise Operations on Circle

You are given an array $C$ of size $N$. You arrange the elements of the array $C$ in a circle in clockwise manner. You can perform the following two types of operations **exactly** $(N-2)$ times in total: - Operation $1$: Select two adjacent elements $X$ and $Y$, and replace $X$ and $Y$ with $X$ $\mid$ $Y$. - Operation $2$: Select two adjacent elements $X$ and $Y$, and replace $X$ and $Y$ with