Factors & Multiples · Hard problem

The Euclidean algorithm on positive integers $a > b$ took exactly three divisions, with quotients $2$, $3$, $4$ in that order, and found $\gcd(a, b) = 5$. Find $a$.