A linear congruence $ax \equiv 1 \pmod{n}$ (asking for a multiplicative inverse of $a$ modulo $n$) has integer solutions if and only if which condition holds?