#include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using pib = pair<int,bool>;
using ll = long long;
using ld = long double;
#define all(x) (x).begin(),(x).end()
#ifdef fread_unlocked
#define fread fread_unlocked
#define fwrite fwrite_unlocked
#endif
#define lc ind<<1
#define rc ind<<1|1
const int MN = 501265, MOD = 1e9+7, BASE = 31;
int h[MN], mx[MN], sq[MN];
int get (int x, int y) {
return h[y] + sq[abs(x-y)];
}
int intersect (int a, int b) { //when does a pass b?
int low = 1, high = min(a,b) - 1, mid, ans = 0;
while (low <= high) {
mid = (low + high) / 2;
if (get(mid,a) > get(mid,b)) low = (ans = mid) + 1;
else high = mid - 1;
}
return ans;
}
int main () {
for (int i = 1; i <= 708; i++) sq[i*i]=i;
for (int i = 501263; i >= 1; i--) if (!sq[i]) sq[i] = sq[i+1];
int n;
scanf ("%d",&n);
for (int i = 1; i <= n; i++) scanf ("%d",h+i);
deque<int> dq;
for (int i = n; i >= 1; i--) {
while ((int)dq.size()>1 && get(i,dq.front()) < get(i,dq[1])) dq.pop_front();
if (i<n) mx[i] = max(mx[i],get(i,dq.front()));
while ((int)dq.size() > 1 && intersect(i,dq.back()) > intersect(dq.back(),dq[(int)dq.size()-2])) dq.pop_back();
dq.push_back(i);
}
dq.clear();
reverse(h+1,h+1+n);
for (int i = n; i >= 1; i--) {
while ((int)dq.size()>1 && get(i,dq.front()) < get(i,dq[1])) dq.pop_front();
if (i<n) mx[n-i+1] = max(mx[n-i+1],get(i,dq.front()));
while ((int)dq.size() > 1 && intersect(i,dq.back()) > intersect(dq.back(),dq[(int)dq.size()-2])) dq.pop_back();
dq.push_back(i);
}
for (int i = 1; i <= n; i++) printf ("%d\n",mx[i] - h[n-i+1]);
return 0;
}
