嘻嘻

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> cows(N);
    for (int i = 0; i < N; ++i) {
        cin >> cows[i];
    }
    
    // 按绝对值排序
    sort(cows.begin(), cows.end(), [](int a, int b) {
        return abs(a) < abs(b);
    });
    
    int total_cost = 0;
    int current_pos = 0;
    int time_elapsed = 0;
    
    for (int i = 0; i < N; ++i) {
        int distance = abs(cows[i] - current_pos);
        time_elapsed += distance;
        total_cost += time_elapsed;
        current_pos = cows[i];
    }
    
    cout << total_cost << endl;
    return 0;
}