HMMT 2021 U21

Bob knows that Alice has 2021 secret positive integers $x_{1}, \ldots, x_{2021}$ that are pairwise relatively prime. Bob would like to figure out Alice's integers. He is allowed to choose a set $S \subseteq\{1,2, \ldots, 2021\}$ and ask her for the product of $x_{i}$ over $i \in S$. Alice must answer each of Bob's queries truthfully, and Bob may use Alice's previous answers to decide his next query. Compute the minimum number of queries Bob needs to guarantee that he can figure out each of Alice's integers.