#include <bits/stdc++.h> //#include<boost/multiprecision/cpp_int.hpp> //#include<boost/multiprecision/cpp_dec_float.hpp> // #include <atcoder/all> using namespace std; #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define repl(i, a) for (long long i = (long long)0; i < (long long)a; ++i) #define rrep(i, a) for (int i = (int)a; i > -1; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define REPL(i, a, b) for (long long i = (long long)a; i < (long long)b; ++i) #define RREP(i, a, b) for (int i = (int)a; i > b; --i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define popcountll __builtin_popcountll #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll mod_998244353 = 998244353; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; // using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁 template <class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template <class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } ll mypow(ll x, ll n, const ll &p = -1) { // x^nをmodで割った余り if (p != -1) { x = (x % p + p) % p; } ll ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } struct myrand{ random_device seed; mt19937 mt; myrand():mt(seed()){} int operator()(int a,int b){//[a,b) uniform_int_distribution<int>dist(a,b-1); return dist(mt); } }; // using namespace atcoder; //------------------------ //------------------------ //------------------------ //------------------------ //------------------------ void solve() { int n; cin>>n; vector<int>p(n); rep(i,n)cin>>p[i]; ll ans=0; set<int>st; rep(i,n)st.emplace(i+1); for(int i=n-1;i>=0;--i){ auto itr=st.upper_bound(p[i]); if(itr!=st.end()){ st.erase(itr); ans+=i+1; }else if(st.count(p[i])){ st.erase(p[i]); }else{ st.erase(st.begin()); ans-=i+1; } } cout<<ans<<"\n"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); solve(); return 0; }