After the first round of data retrieval, the sequence transformation is as follows: (3,4) (7,8) (11,12) (2007,2008), and after the transformation into natural numbers, it is 4,8,12,/kl.
After the second round of data retrieval, the sequence is converted into 4, 12, 20, 28,, 1988, 1996, 2004 * * * 25 1, and the arithmetic difference is 8.
After the third round of fetching, after odd-numbered items on the circumference are fetched again, the sequence becomes 2004, 4, 20, 36, 52, 68, 1956, 1972, 1988. Starting from the second item, the latter item is 16, which is * * more than the former item.
In the fourth round of data retrieval, the series changed to 2004, 20, 52, 84, 1 16,, 1908, 1940, 1972, * * 63, which was the same as the second item.
After odd-numbered items on the circumference are fetched, the order becomes 1972, 2004, 52, 1 16,, 1844, 1908 from the third item, and the last item is 64. * * 32 more than the previous item.
Because the factorization factor of 32 does not contain odd numbers, the last number left in this series is 1972, and the number of chess pieces should be 197 1 and 1972.