#include <bits/stdc++.h>
using namespace std;
long long int apSum(long long int a, long long int n, long long int d = 1) {
  long long int res = (2 * a + (n - 1) * d) * n;
  res /= 2;
  return res;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool isPrime(long long int n) {
  for (long long int i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return true;
}
void solve() {
  long long int n;
  cin >> n;
  long long int list[n];
  for (long long int i = 0; i < n; i++) {
    cin >> list[i];
  };
  vector<long long int> arr(n + 1, 0);
  for (long long int i = 0; i < n; i++) {
    vector<long long int> local(n + 1, 0);
    long long int previos = -1;
    for (long long int j = i; j < n; j++) {
      long long int now = list[j], ans;
      local[now] += 1;
      if (previos == -1) {
        ans = now;
      } else {
        if (local[previos] < local[now])
          ans = now;
        else if (local[previos] > local[now])
          ans = previos;
        else if (now < previos)
          ans = now;
        else
          ans = previos;
      }
      arr[ans] += 1;
      previos = ans;
    }
  }
  for (long long int i = 1; i < n + 1; i++) {
    cout << arr[i] << " ";
  };
  cout << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int testCases = 1;
  while (testCases--) {
    solve();
  }
}
