Olja writes down $n$ positive integers $a_{1}, a_{2}, \ldots, a_{n}$ smaller than $p_{n}$ where $p_{n}$ denotes the $n$-th prime number. Oleg can choose two (not necessarily different) numbers $x$ and $y$ and replace one of them with their product $x y$. If there are two equal numbers Oleg wins. Can Oleg guarantee a win? Please provide the smallest integer n for which Oleg can guarantee a win.

Let's think step by step and output the final answer within \boxed{}.
user