CMOQR 2014 Problem 3

Let $1000 \leq n = \text{ABCD}_{10} \leq 9999$ be a positive integer whose digits $\text{ABCD}$ satisfy the divisibility condition: $$1111 | (\text{ABCD} + \text{AB} \times \text{CD}).$$ Determine the smallest possible value of $n$ .