Chef and Array

Chef has finally arrived at the new planet. But he is is currently alone and wants to spend his time on bitwise operators. He has an array $A$ of size $N$. While playing with it, he came upon to a new problem. Fortunately he has his long telescope through which he can still communicate with you. And as you are free, you agreed to help him. The problem is you need to find the minimum number of op