Given an integer array $A$ of size $N,$ write a $C++$ program to sort the array $A$ in ascending order based on the number of ones in the binary representations of its elements. If two or more elements have the same number of ones in their binary representations, print "IMPOSSIBLE".

EXAMPLE: $-$

IF N $=3,$ INPUT $=[10,7,8],$ Output: $8,10,7$

IF N $=4,{?}_{?}$ INPUT $=[9,4,10,2],$ Output: IMPOSSIBLE