Two positive integers $a > b$ are fed to the Euclidean algorithm, which divides repeatedly: $a$ by $b$, then $b$ by the remainder, and so on, until a remainder is $0$. It makes exactly $8$ divisions, the last one leaving remainder $0$. What is the least possible value of $a + b$?