Chef XOR

Chef is new to bit-manupilation and has recently known the term XOR so he is stuck with the task below. He is given an array of integers $A$ with size $N$ and a character denoting section. There are two section A & B. In both section he has to do below two task. $1$. For all possible $i,j$ such that $1\leq i,j \leq N$ find sum of $A[i]$ and $A[j]$ $2$. Compute XOR of all those sums. Only dif