//#define _GLIBCXX_DEBUG

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <random>
#include <stdio.h>
#include <fstream>
#include <functional>
#include <cassert>



using namespace std;



#define rep(i,n) for (int i=0;i<n;i+=1)
#define append push_back
#define all(x) (x).begin(), (x).end()

template<class T>
using vec = vector<T>;
template<class T>
using vvec = vec<vec<T>>;
template<class T>
using vvvec = vec<vvec<T>>;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;


template<class T>
bool chmin(T &a, T b){
  if (a>b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b){
  if (a<b){
    a = b;
    return true;
  }
  return false;
}

template<class T>
T sum(vec<T> x){
  T res=0;
  for (auto e:x){
    res += e;
  }
  return res;
}

template<class T>
void printv(vec<T> x){
  for (auto e:x){
    cout<<e<<" ";
  }
  cout<<"\n";
}

template<class T>
ostream& operator<<(ostream& os, const vec<T>& A){
  os << "{";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "}" ;
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const deque<T>& A){
  os << "deque{[";
  rep(i,A.size()){
    os << A[i];
    if (i!=A.size()-1){
      os << ", ";
    }
  }
  os << "]}" ;
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const pair<T,T>& A){
  os << "(";
  os << A.first ;
  os << ", ";
  os << A.second;
  os << ")";
  return os;
}

template<class T>
ostream& operator<<(ostream& os, const tuple<T,T,T>& A){
  auto [a,b,c] = A;
  os << "(";
  os << a;
  os << ",";
  os << b;
  os << ",";
  os << c;
  os << ")";
  return os;
}


void solve(){
  int N;
  cin>>N;
  vec<int> P(N),pos(N);
  rep(i,N){
    cin>>P[i];
    P[i]--;
    pos[P[i]] = i;
  }

  vec<int> left(N,0),right(N,N-1);
  vec<int> left_st;
  rep(i,N){
    while (!left_st.empty()){
      int idx = left_st.back();
      if (P[idx] < P[i]){
        left_st.pop_back();
      }
      else{
        break;
      }
    }
    if (!left_st.empty()){
      left[i] = left_st.back();
    }
    left_st.push_back(i);
  }

  vec<int> right_st;
  for (int i=N-1;0<=i;i--){
    while (!right_st.empty()){
      int idx = right_st.back();
      if (P[idx] < P[i]){
        right_st.pop_back();
      }
      else{
        break;
      }
    }
    if (!right_st.empty()){
      right[i] = right_st.back();
    }
    right_st.push_back(i);
  }

  vec<ll> imos(N+1,0);

  vec<ll> propagate_add(N,1);
  rep(val,N){
    int idx = pos[val];
    int L = left[idx],R = right[idx];
    imos[L] -= propagate_add[idx];
    imos[R+1] += propagate_add[idx];
    imos[idx] -= 1;
    imos[idx+1] += 1;
    
    if (L == 0){
      if (R == N-1) continue;
      propagate_add[R] += propagate_add[idx];
    }
    else{
      if (R == N-1){
        propagate_add[L] += propagate_add[idx];
      }
      else{
        if (P[L] < P[R]){
          propagate_add[R] += propagate_add[idx];
        }
        else{
          propagate_add[L] += propagate_add[idx];
        }
      }
    }
  }

  vec<ll> maximum_dist(N,1);
  for (int val=N-1;0<=val;val--){
    int idx = pos[val];
    int L = left[idx],R = right[idx];
    if (L == 0){
      if (R == N-1) continue;
      maximum_dist[idx] = 1 + maximum_dist[R];
    }
    else{
      if (R == N-1){
        maximum_dist[idx] = 1 + maximum_dist[L];
      }
      else{
        if (P[L] < P[R]){
          maximum_dist[idx] = 1 + maximum_dist[R];
        }
        else{
          maximum_dist[idx] = 1 + maximum_dist[L];
        }
      }
    }
  }

  rep(val,N){
    imos[0] += maximum_dist[val] + 1;
  }

  rep(i,N){
    imos[i+1] += imos[i];
    cout << imos[i] << " ";
  }

}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int T;
    T = 1;
    while (T--){
      solve();
    }

        

}