3. (Flowing Orchid) For $x \geqslant 1$, let $p(x)$ be the smallest prime number that does not divide $x$, and $q(x)$ be the product of all primes less than $p(x)$. Specifically, $p(1)=2$. If some $x$ makes $p(x)=2$, then define $q(x)=1$. The sequence $x_{0}, x_{1}, x_{2}, \cdots$ is defined by the following formula, with $x_{0}=1$.
$$
x_{n+1}=\frac{x_{n} p\left(x_{n}\right)}{q\left(x_{n}\right)},
$$

where $n \geqslant 0$. Find all integers $n$ such that $x_{n}=1995$.