#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; int main() { int N; cin >> N; vector<int> stones(N); for (int& s : stones) cin >> s; int total = accumulate(stones.begin(), stones.end(), 0); int target = total / N; vector<int> diff(N); for (int i = 0; i < N; ++i) { diff[i] = stones[i] - target; } int moves = 0; for (int i = 0; i < N; ++i) { if (diff[i] > 0) { moves += diff[i]; diff[(i + 1) % N] -= diff[i]; } } cout << moves << endl; return 0; }