#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
vector<long long> vec[3000005];
long long fastexpo(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b = b / 2;
    a = (a * a) % mod;
  }
  return ans % mod;
}
long long dp[1000005] = {0};
bool vis[1000005] = {0};
long long bits(long long x) {
  long long num = 0;
  while (x) {
    if (!(x & 1)) {
      num++;
    }
    x /= 2;
  }
  return num;
}
long long countDivisibles(long long A, long long B, long long M) {
  if (A % M == 0) return (B / M) - (A / M) + 1;
  return (B / M) - (A / M);
}
int32_t main() {
  long long n;
  cin >> n;
  long long dp[n + 1], arr[n];
  for (long long i = 0; i < n; i++) cin >> arr[i];
  long long ans[n][n];
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) dp[j + 1] = 0;
    long long max1 = arr[i];
    for (long long j = i; j < n; j++) {
      dp[arr[j]]++;
      if (dp[arr[j]] > dp[max1]) {
        max1 = arr[j];
      } else {
        if (dp[arr[j]] == dp[max1]) {
          max1 = min(arr[j], max1);
        }
      }
      ans[i][j] = max1;
    }
  }
  for (long long i = 0; i < n; i++) {
    dp[i + 1] = 0;
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = i; j < n; j++) {
      dp[ans[i][j]]++;
    }
  }
  for (long long i = 1; i <= n; i++) {
    cout << dp[i] << " ";
  }
  return 0;
}
