#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:216000000")
using namespace std;
const long long MAX = numeric_limits<long long>::max();
const long long MIN = numeric_limits<long long>::min();
const double PI = 3.1415926535;
const long long MOD = 1000000007;
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (int i = 0; i < v.size(); ++i) out << v[i] << " ";
  out << endl;
  return out;
}
template <class T>
istream& operator>>(istream& in, vector<T>& v) {
  for (int i = 0; i < v.size(); ++i) in >> v[i];
  return in;
}
template <class R, class L>
istream& operator>>(istream& in, pair<R, L>& p) {
  in >> p.first >> p.second;
  return in;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long ceil(long long a, long long b) {
  if (a % b) return a / b + 1;
  return a / b;
}
long long mod(long long a, long long b) { return (a % b + b) % b; }
long long inv_by_mod(long long x, long long m) {
  if (x == 0) return 1;
  long long ans = 1;
  long long cur = x;
  long long pow = m - 2;
  while (pow > 0) {
    if (pow & 1) ans = mod(ans * cur, m);
    pow >>= 1;
    cur = mod(cur * cur, m);
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n;
  cin >> n;
  vector<int> a(n);
  cin >> a;
  for (int i = 0; i < n; ++i) {
    a[i]--;
  }
  vector<int> count(n);
  for (int i = 0; i < n; ++i) {
    vector<int> ccur(n);
    int dom = a[i];
    for (int j = i; j < n; ++j) {
      ccur[a[j]]++;
      if (ccur[a[j]] > ccur[dom])
        dom = a[j];
      else if (ccur[a[j]] == ccur[dom]) {
        dom = min(dom, a[j]);
      }
      count[dom]++;
    }
  }
  cout << count;
}
