#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
  return (b == 0) ? a : gcd(b, a % b);
}
const unsigned int MOD = 1000000007;
long long int inf = 1000000000000000000;
long long int MODI = 998244353;
template <class T>
T power(T a, long long int n) {
  T res = 1;
  while (n > 0) {
    if (n % 2) res = (res * a);
    a = (a * a), n = n / 2;
  }
  return res;
}
bool isprime(int n) {
  if (n <= 1) return false;
  for (int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
bool issq(long long int n) {
  double d = n;
  double p1 = sqrt(d);
  long long int p2 = sqrt(n);
  return (p1 == p2);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  vector<long long int> arr;
  ;
  for (long long int i = 0; i <= n - 1; i++) {
    long long int a;
    cin >> a;
    arr.push_back(a);
  }
  map<long long int, long long int> ans;
  for (int i = 0; i <= n - 1; i++) {
    long long int maxx = 0, maxxind = 0;
    vector<long long int> maps(n + 1, 0);
    ;
    for (int j = i; j <= n - 1; j++) {
      maps[arr[j]]++;
      if (maps[arr[j]] > maxx) {
        maxx = maps[arr[j]];
        maxxind = arr[j];
        ans[arr[j]]++;
      } else if (maps[arr[j]] == maxx) {
        if (arr[j] < maxxind)
          ans[arr[j]]++, maxxind = arr[j];
        else
          ans[maxxind]++;
      } else
        ans[maxxind]++;
    }
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
}
