#include <iostream>
#include <iomanip>
#include <cstring>
#include <algorithm> 
#include <math.h>
#include <queue>
#include <functional>
#include <map>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;

const ll INF = 1000000005;

ll n, sum;
ll y[100005];
int main(void){
    cin >> n;
    map<ll, int> mp;
    int h = 0;
    bool plus = false, minus = false;
    int num;
    for (int i = 0; i < n; i++){
        cin >> y[i];
        if (y[i] >= 0) plus = true;
        else minus = true;
        mp[y[i]]++;
        if (h < mp[y[i]]){
            h = mp[i];
            num = i;
        }
    }

    ll Y;
    if (plus&&minus) Y = 0;
    else Y = y[num];

    ll ans = 0;
    for (int i = 0; i < n; i++){
        ans += abs(Y - y[i]);
    }

    cout << ans << endl;
}