在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网

格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成  (x,y),(x+1,y),…,(x+n-1,y)。如何选择x  和y的值才能使士兵们以最少的总移动步数排成一列。计算使所有士兵排成一行需要的最少移动步数。-On a grid divided into the playground, n soldiers stood scattered on the grid points. Represented by an integer grid point coordinates (x, y). Soldiers along the edge of the grid, down, left, right movement step, but at the same time on any grid point to only one soldier. According to the officer' s orders, the soldiers want to queue neatly fitted to a level that arranged (x, y), (x+1, y), ..., (x+n-1, y). How to choose the x and y values ​ ​ to make the soldiers move with minimal total number of steps in a row. Calculated so that all the soldiers lined up the required minimum number of steps to move.