#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<array<int, 2>> a;
vector<int> pos;
long long cal(vector<int> v) {
long long res = 0;
for (int i = 0; i < (int) v.size(); i++){
for (int j = i + 1; j < (int) v.size(); j++){
int d = abs(v[i] - v[j]);
res += std::min(d, 50000 - d);
}
}
return res;
}
void rotate(std::vector<int> t, int x);
void energy(int n, std::vector<int> v) {
vector<int> cur_vector = v;
pos.resize(n);
for (int i = 0; i < v.size(); i ++) a.push_back({v[i], i});
sort(a.begin(), a.end());
for (int i = 0; i < v.size(); i ++) v[i] = a[i][0], pos[i] = a[i][1];
if (v.back() <= 25000) {
for (int i = 0; i < v.size() / 2; i ++)
rotate({pos[i]}, 100000 - v[i]);
for (int i = v.size() / 2; i < v.size(); i ++)
rotate({pos[i]}, 25000 - v[i]);
return;
} else {
ll x = v.back() - 25000; ll old_value = cal(cur_vector);
for (int i = v.size() - 2; i >= 0; i --) {
for (int j = x + 25000; j >= x; j --) {
ll o = cur_vector[pos[i]];
cur_vector[pos[i]] = j;
ll tmp = cal(cur_vector);
if (tmp >= old_value) {
rotate({pos[i]}, j - v[i] + 100000);
// for (auto x: cur_vector) cout << x << ' '; cout << endl;
old_value = tmp;
break;
}
cur_vector[pos[i]] = o;
}
}
for (int i = 0; i < v.size() / 2; i ++)
rotate({pos[i]}, x - v[i] + 100000);
// cout << "??? " << endl;
for (int i = v.size() / 2; i < v.size(); i ++)
rotate({pos[i]}, x + 25000 - v[i] + 100000);
return;
}
}
