KöMaL 2025 A898

Let $n$ be a given positive integer. Ana and Bob play the following game: Ana chooses a polynomial $p$ of degree $n$ with integer coefficients. In each round, Bob can choose a finite set $S$ of positive integers, and Ana responds with a list containing the values of the polynomial $p$ evaluated at the elements of $S$ with multiplicity (sorted in increasing order). Determine, in terms of $n$, the smallest positive integer $k$ such that Bob can always determine the polynomial $p$ in at most $k$ rounds.