说明：  这是一个二分图完全匹配问题， 题意：给出一组数，这组数按给出的序列从标号1依次递增编号，现在要求你编写一个程序改变这些数的序列，使得每个数和其下标的最大公约数和相加得到的数最小。
(This is a complete bipartite graph matching problem, meaning title: In this paper, a group of a few, this group is given the serial number by one from the label followed by incremental number, and now ask you to prepare a program to change these number sequences, making each number and under the common denominator and the sum has been the subject of a number of the smallest.)