Factors & Multiples · Superchallenge problem

Positive integers $a > b$ are chosen so that the Euclidean algorithm on $(a, b)$ takes exactly $10$ divisions. What is the smallest possible value of $a + b$?