#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define mp make_pair
#define pq priority_queue
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll=pair<ll,ll>;
using vi = vector<int>;
using vb=vector<bool>;
using vll=vector<ll>;
using str = string;
const ll inf = 2 * 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
int arr[n];
for (int i=0;i<n;++i) cin>>arr[i];
int ans[n];
vector<pii> a;
for (int i=0;i<n;++i){
a.pb({arr[i]+arr[(i+1)%n],i});
}
sort(a.begin(),a.end());
for (int i=0;i<n;++i){
ans[a[i].s]=i;
}
for (int i:ans) cout<<i<<" ";
return 0;
}
1461A - String Generation | 1585B - Array Eversion |
1661C - Water the Trees | 1459A - Red-Blue Shuffle |
1661B - Getting Zero | 1661A - Array Balancing |
1649B - Game of Ball Passing | 572A - Arrays |
1455A - Strange Functions | 1566B - MIN-MEX Cut |
678C - Joty and Chocolate | 1352E - Special Elements |
1520E - Arranging The Sheep | 1157E - Minimum Array |
1661D - Progressions Covering | 262A - Roma and Lucky Numbers |
1634B - Fortune Telling | 1358A - Park Lighting |
253C - Text Editor | 365B - The Fibonacci Segment |
75A - Life Without Zeros | 1519A - Red and Blue Beans |
466A - Cheap Travel | 659E - New Reform |
1385B - Restore the Permutation by Merger | 706A - Beru-taxi |
686A - Free Ice Cream | 1358D - The Best Vacation |
1620B - Triangles on a Rectangle | 999C - Alphabetic Removals |