1. People numbered $1,2, \cdots, 2015$ are arranged in a line, and a position-swapping game is played among them, with the rule that each swap can only occur between adjacent individuals. Now, the person numbered 100 and the person numbered 1000 are to swap positions, with the minimum number of swaps required being $\qquad$ times.
$$
-, 1.1799 .
$$

Using the formula, the minimum number of swaps required is
$$
(1000-100) \times 2-1=1799
$$

times.
