public int getMin(int[] position) {
		int min = Integer.MAX_VALUE;
		for (int i = 0; i < position.length - 1; i++) {
			int sum = 0;
			int old = position[0];
			for (int j = 1; j < position.length; j++) {
				if (i != j) {
					sum += Math.abs(old - position[j]);
					old = position[j];
				}
			}
			min = Math.min(min, sum);
		}
		return min;
	}