Q$3]$ Given an SRAM of depth $N$ and some arbitrary width $K,$ which is filled with $2n+1$ non$-$zero values $($for completeness $-$ the rest of the $2^N-(2n+1)$ are all zeroes$).n$ elements appear twice $-$ in different places in the SRAM, while a single value appears only once.

Design a circuit with the minimum amount of hardware to find the value which appears only once.