#include "rotate.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
//#define endl '\n'
#define ll long long
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define orderset tree<pair<int,int>,null_type,less<pair<int,int>>,rb_tree_tag,tree_order_statistics_node_update>
void energy(int n,vector<int> v){
orderset se;
const int deg90=25000,deg180=50000;
vector<pair<int,int>> order(n);
for(int i=0;i<n;i++){
order[i]={v[i],i};
}
sort(order.begin(),order.end());
while(order.size()>1){
if(order[0].first>=deg90){
for(int i=0;i<order.size()-1-i;i++){
rotate({order[i].second},deg180-(order[i].first-deg90));
rotate({order[order.size()-1-i].second},deg180-order[order.size()-1-i].first);
}
return;
}
vector<int> le,ri;
bool flag=false;
for(int i=1;i<order.size();i++){
if(order[i].first==order[0].first+deg90){
flag=true;
order.erase(order.begin()+i);
break;
}
else if(order[i].first<order[0].first+deg90){
le.push_back(i);
}
else{
ri.push_back(i);
}
}
if(flag){
order.erase(order.begin());
continue;
}
if(le.size()>=ri.size()){
int idx=le.back();
rotate({order[idx].second},order[0].first+deg90-order[idx].first);
order.erase(order.begin()+idx);
}
else{
int idx=ri[0];
rotate({order[idx].second},deg180-(order[idx].first-order[0].first-deg90));
order.erase(order.begin()+idx);
}
order.erase(order.begin());
}
}
