Find the smallest integer $n > 3$ such that, for each partition of $\{3, 4, \ldots, n\}$ into two sets, at least one of these sets contains three (not necessarily distinct) numbers $a, b, c$ for which $ab = c$.

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