Imagine, you have $256$ boxes with different weights each. You want to take out the most weighted $2$ boxes among them. You can compare only $2$ boxes at a time. What is the least number of times you need to compare among the boxes, to get the required $2$ boxes?