# How can I use induction for proving termination of a string rewriting system?

If we have a string rewriting system within the alphabet $$\{X,Y\}^*$$ and the rule $$XY\to YX$$. How can we prove by induction that on every string input the system terminates?