I have two 'bin's containing natural numbers (both equal size 'n'), and I am told to take out two numbers, one from each 'bin'. Each time I select the numbers, I find their summation. This process continues till the 'bin's are exhausted. I have to find out whether all such summations can be equal. With what best time complexity can I check whether this is possible or not?