#include <bits/stdc++.h>
using namespace std;
int N;
int A[5003];
int pre[5003][5003];
int dp[5003][5003];
int ans[5003];
int main(int argc, char** argv) {
  std::ios::sync_with_stdio(false);
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> A[i];
  for (int k = 1; k <= N; k++) {
    for (int i = 1; i <= N; i++) {
      pre[k][i] = pre[k][i - 1] + (A[i] == k);
    }
  }
  for (int i = 1; i <= N; i++) {
    dp[i][i] = A[i];
    ans[A[i]]++;
  }
  for (int l = 2; l <= N; l++) {
    for (int i = 1; i + l - 1 <= N; i++) {
      int j = i + l - 1;
      int a1 = dp[i][j - 1];
      int a2 = A[j];
      int c1 = pre[a1][j] - pre[a1][i - 1];
      int c2 = pre[a2][j] - pre[a2][i - 1];
      int mx;
      if (c1 > c2)
        mx = a1;
      else if (c1 < c2)
        mx = a2;
      else
        mx = min(a1, a2);
      ans[mx]++;
      dp[i][j] = mx;
    }
  }
  for (int i = 1; i <= N; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
