#include<bits/stdc++.h>
using namespace std;
template <typename T> bool maximize(T &res, const T &val){if(res < val) return res = val, true; return false;}
template <typename T> bool minimize(T &res, const T &val){if(res > val) return res = val, true; return false;}
#define ll long long
#define fi first
#define se second
#define pb push_back
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; i++)
#define FORD(i, b, a) for(int i = (b), _a = (a); i >= _a; i--)
#define REP(i, n) for(int i = 0, _n = (n); i < _n; i++)
#define C make_pair
#define MASK(i) (1LL << (i))
#define TURN_ON(i, x) ((x) | MASK(i))
#define TURN_OFF(i, x) ((x) & ~MASK(i))
#define RE(i, x) ((x) ^ MASK(i))
const ll mod = 1e9 + 7;
const ll INF = 1e15;
const int maxn = 1e5 + 5;
const int N = 2e6;
typedef pair<int, int> pi;
typedef pair<int, pair<int,int>> pii;
typedef pair<ll, ll> pl;
typedef pair<ll, pair<ll,ll>>pll;
struct edge{
int u,v,w;
edge(int u = 0, int v = 0, int w = 0)
{
this->u = u;
this->v = v;
this->w = w;
}
};
struct matrix{
ll val[3][3];
matrix(){
memset(val, 0, sizeof(val));
}
};
int n, a[5010];
ll ans[5010];
int mp[2 * N + 100];
void nhap(){
cin >> n;
FOR(i, 1, n) cin >> a[i];
}
void solve(){
mp[a[1] + a[2] + N]++;
FOR(k, 3, n - 1){
FOR(x, k + 1, n){
ans[x] += mp[a[x] - a[k] + N];
}
FOR(i, 1, k - 1) mp[a[i] + a[k] + N]++;
}
FOR(i, 1, n) cout << ans[i] << " ";
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
nhap();
solve();
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp0ZW1wbGF0ZSA8dHlwZW5hbWUgVD4gYm9vbCBtYXhpbWl6ZShUICZyZXMsIGNvbnN0IFQgJnZhbCl7aWYocmVzIDwgdmFsKSByZXR1cm4gcmVzID0gdmFsLCB0cnVlOyByZXR1cm4gZmFsc2U7fQp0ZW1wbGF0ZSA8dHlwZW5hbWUgVD4gYm9vbCBtaW5pbWl6ZShUICZyZXMsIGNvbnN0IFQgJnZhbCl7aWYocmVzID4gdmFsKSByZXR1cm4gcmVzID0gdmFsLCB0cnVlOyByZXR1cm4gZmFsc2U7fQoKI2RlZmluZSBsbCBsb25nIGxvbmcKI2RlZmluZSBmaSBmaXJzdAojZGVmaW5lIHNlIHNlY29uZAojZGVmaW5lIHBiIHB1c2hfYmFjawojZGVmaW5lIEZPUihpLCBhLCBiKSBmb3IoaW50IGkgPSAoYSksIF9iID0gKGIpOyBpIDw9IF9iOyBpKyspCiNkZWZpbmUgRk9SRChpLCBiLCBhKSBmb3IoaW50IGkgPSAoYiksIF9hID0gKGEpOyBpID49IF9hOyBpLS0pCiNkZWZpbmUgUkVQKGksIG4pIGZvcihpbnQgaSA9IDAsIF9uID0gKG4pOyBpIDwgX247IGkrKykKI2RlZmluZSBDIG1ha2VfcGFpcgojZGVmaW5lIE1BU0soaSkgKDFMTCA8PCAoaSkpCiNkZWZpbmUgVFVSTl9PTihpLCB4KSAoKHgpIHwgTUFTSyhpKSkKI2RlZmluZSBUVVJOX09GRihpLCB4KSAoKHgpICYgfk1BU0soaSkpCiNkZWZpbmUgUkUoaSwgeCkgKCh4KSBeIE1BU0soaSkpCgpjb25zdCBsbCBtb2QgPSAxZTkgKyA3Owpjb25zdCBsbCBJTkYgPSAxZTE1Owpjb25zdCBpbnQgbWF4biA9IDFlNSArIDU7CmNvbnN0IGludCBOID0gMmU2Owp0eXBlZGVmIHBhaXI8aW50LCBpbnQ+IHBpOwp0eXBlZGVmIHBhaXI8aW50LCBwYWlyPGludCxpbnQ+PiBwaWk7CnR5cGVkZWYgcGFpcjxsbCwgbGw+IHBsOwp0eXBlZGVmIHBhaXI8bGwsIHBhaXI8bGwsbGw+PnBsbDsKCnN0cnVjdCBlZGdlewogICAgaW50IHUsdix3OwogICAgZWRnZShpbnQgdSA9IDAsIGludCB2ID0gMCwgaW50IHcgPSAwKQogICAgewogICAgICAgIHRoaXMtPnUgPSB1OwogICAgICAgIHRoaXMtPnYgPSB2OwogICAgICAgIHRoaXMtPncgPSB3OwogICAgfQp9OwpzdHJ1Y3QgbWF0cml4ewogICAgbGwgdmFsWzNdWzNdOwogICAgbWF0cml4KCl7CiAgICAgICAgbWVtc2V0KHZhbCwgMCwgc2l6ZW9mKHZhbCkpOwogICAgfQp9OwoKaW50IG4sIGFbNTAxMF07CmxsIGFuc1s1MDEwXTsKaW50IG1wWzIgKiBOICsgMTAwXTsKCnZvaWQgbmhhcCgpewoJY2luID4+IG47CglGT1IoaSwgMSwgbikgY2luID4+IGFbaV07Cn0Kdm9pZCBzb2x2ZSgpewoJbXBbYVsxXSArIGFbMl0gKyBOXSsrOwoJRk9SKGssIDMsIG4gLSAxKXsKCQlGT1IoeCwgayArIDEsIG4pewoJCQlhbnNbeF0gKz0gbXBbYVt4XSAtIGFba10gKyBOXTsKCQl9CgkJRk9SKGksIDEsIGsgLSAxKSBtcFthW2ldICsgYVtrXSArIE5dKys7Cgl9CglGT1IoaSwgMSwgbikgY291dCA8PCBhbnNbaV0gPDwgIiAiOwp9CmludCBtYWluKCl7CiAgICBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKDApOwogICAgY2luLnRpZSgwKTsgY291dC50aWUoMCk7CgluaGFwKCk7Cglzb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0K