SE-SKOLORNAS 1999 Problem 6

$S$ is any sequence of at least $3$ positive integers. A move is to take any $a, b$ in the sequence such that neither divides the other and replace them by gcd $(a,b)$ and lcm $(a,b)$ . Show that only finitely many moves are possible and that the final result is independent of the moves made, except possibly for order.