Euclid's algorithm

Suppose that $a$ and $b$ are positive integers, and $a + b = 239$. Enter the maximal integer that can possibly be the greatest common divisor of $a$ and $b$. (Hint: note that $239$ is prime and think what follows from the fact that some $d$ is a common divisor of $a$ and $b$.