There are N integers in a list A. All integers except one integer occur in pairs (the integers in the pair may not be
adjacent i.e. the two numbers in a pair can separately exist anywhere in the list). Write an algorithm (in pseudo code
form) to find out the number that occurs only once.