Inclusion--Exclusion, Derangements & Pigeonhole · Hard problem

What is the least number of integers that must be chosen from $\{1,2,\dots,100\}$ to guarantee that two of the chosen numbers are relatively prime?