What is the minimum number of successive swaps of adjacent letters in the string $ABCDEFG$ that are needed to change the string to $GFEDCBA$?