Find number in array

There is an array consisting of 2n+1 unsigned integers. n numbers in the array are "married", i.e they occur twice in the array. However there is one number only appears once in the array. Find that number in a single pass using constant memory.

Eg : 3 5 3 4 1 5 1 7 2 2 4
Ans: 7