Erdős problem 1214

Let $x,y\geq 1$ be integers such that, for all $n\geq 1$, the set of primes dividing $x^{n}-1$ is equal to the set of primes dividing $y^n-1$. Must $x=y$?