Question 14
A box contains 100 cards, where each card is labelled with the integers from 1 to 100. If the cards are drawn one at a time without putting back, what is the minimum number of cards that must be drawn to guarantee that, among the cards selected, the label of one of the cards is exactly twice the label of another card? (If your answer is $n$, write the $n-1$ integers of your choice such that no integer is exactly twice of another integer.)