Part $1$: Coding task

Task: You are given an array with $2n+1$ numbers. Among these numbers there are $n$ pairs and

one single number. Write an assembly program that finds the single number without using

any compare instructions $($i$.$e$.,$ no $cmp$ or tst$).$

For example, given the array $34,45,21,21,34$ your program should find $45.$ This is a very

nice puzzle, actually. Can you find the single number without any comparisons? Yes, you can,

and it is pure LOGIC. Give it some thought before looking up how to do it$.$ Play around with

some logic functions in CCS and see how they behave.