#include #include #include #include using namespace std;

int main() { int n; cin >> n;

vector<int> positions(n);
for (int i = 0; i < n; i++) {
    cin >> positions[i];
}

// 排序
sort(positions.begin(), positions.end());

// 取中位数（下标从0开始）
int median_index = n / 2;  // 对于偶数，取中间偏左的（或中间偏右的也可以）
int median = positions[median_index];

// 计算总距离
long long total_distance = 0;
for (int i = 0; i < n; i++) {
    total_distance += abs(positions[i] - median);
}

cout << total_distance << endl;

return 0;

}