uva11300

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;

const int maxn = 1000007;
long long int input[maxn],c[maxn],n;
int main()
{
    
    static auto speedup = [](){
    ios::sync_with_stdio(false);cin.tie(nullptr);return nullptr;}();
    while(cin >> n){
    
        long long int tot = 0;
        for(int i = 0;i < n;i++){
    
            cin >> input[i];
            tot += input[i];
        }
        
        long long int m = tot / n;
        c[0] = 0;
        for(int i = 1;i < n;i++){
    
            c[i] = c[i-1] + input[i] - m;
        }
        sort(c,c+n);
        long long int mid = c[n/2],ans = 0;
        for(int i = 0;i < n;i++ ){
    
            ans += abs(mid - c[i]);
        }
        cout << ans << endl;
    }
    return 0;
}