Invariants & Monovariants · Superchallenge problem

Start with the pair $(2, 1)$. A move replaces $(a, b)$ with $(a + b, b)$ or $(a, a + b)$. What is $\gcd(m, n)$ for EVERY pair $(m, n)$ reachable this way?