Erdős problem 728

Whether there are infinitely many integers $a, b, n$ with $a, b \ge \varepsilon n$ such that $a!\cdot b!$ divides $n!\cdot(a+b-n)!$ while $a+b$ exceeds $n$ by more than $C\cdot\log n$.