There are balls divided into several piles. We can choose any two piles, denoted as pile A and pile B, and move balls according to the following rule: if the number of balls in pile A, denoted as , is no less than the number of balls in pile B, denoted as , then move balls from pile A to pile B. This counts as one move. Prove that it is possible to combine all the balls into one pile through a finite number of moves.