/*
ID: hepic
PROG: sabotage
LANG: C++11
*/
#include <bits/stdc++.h>

#define FOR(i, a, b) for(auto i=a; i<=b; ++i)
#define REP(i, a, b) for(auto i=a; i<b; ++i)
#define FORI(i, a, b) for(auto i=a; i!=b+1-2*(a>b); i+=1-2*(a>b))
#define REPI(i, a, b) for(auto i=a-(a>b); i!=b-(a>b); i+=1-2*(a>b))
#define ALL(v) v.begin(),v.end()
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define eb(a, b) emplace_back(a, b)
#define fir first
#define sec second
#define what_is(x) cout<<#x<<" is "<<x<<endl;
#define type(x) typeid(x).name()
#define ms(arr, val) memset(arr, val, sizeof(arr))
#define min3(a,b,c) min(min(a,b),c)
#define max3(a,b,c) max(max(a,b),c)
#define PI acos(-1)
#define open_read freopen("disrupt.in", "r", stdin)
#define open_write freopen("disrupt.out", "w", stdout)

using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef pair<double, double> PDD;
typedef pair<int, int> PII;
typedef pair<int, PII> PIPII;
typedef pair<PII, PII> PPIIPII;
typedef pair<LL, LL> PLL;
typedef pair<ULL, ULL> PUU;
typedef pair<LL, PLL> PLPLL;
typedef pair<PLL, PLL> PPLLPLL;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;


template<typename T, typename T1>
ostream& operator << (ostream &out, pair<T, T1> obj) {
    out << "(" << obj.first << ", " << obj.second << ")";
    return out;
}


template<typename T, typename T1>
ostream& operator << (ostream &out, map<T, T1> cont) {
    typename map<T, T1>::const_iterator itr = cont.begin();
    typename map<T, T1>::const_iterator ends = cont.end();

    for(; itr != ends; ++itr) {
        out << *itr << " ";
    }

    out<<endl;
    return out;
}


template<typename T>
ostream& operator << (ostream &out, set<T> cont) {
    typename set<T>::const_iterator itr = cont.begin();
    typename set<T>::const_iterator ends = cont.end();
    
    for(; itr != ends; ++itr) {
        out << *itr << " ";
    }

    out << endl;
    return out;
}


template<typename T>
ostream& operator << (ostream &out, multiset<T> cont) {
    typename multiset<T>::const_iterator itr = cont.begin();
    typename multiset<T>::const_iterator ends = cont.end();

    for (; itr != ends; ++itr) {
        out << *itr << " ";
    }

    out << endl;
    return out;
}


template<typename T, template<typename ELEM, typename ALLOC=allocator<ELEM>> class CONT>
ostream& operator << (ostream &out, CONT<T> cont) {
    typename CONT<T>::const_iterator itr = cont.begin();
    typename CONT<T>::const_iterator ends = cont.end();

    for (; itr != ends; ++itr) {
        out << *itr << " ";
    }

    out << endl;
    return out;
}


template<typename T, unsigned int N, typename CTy, typename CTr>
typename enable_if<!is_same<T, char>::value, basic_ostream<CTy, CTr> &>::type
operator << (basic_ostream<CTy, CTr> &out, const T (&arr)[N]) {
    REP (i, 0, N) {
        out << arr[i] << " ";
    }

    out << endl;
    return out;
}


template<typename T>
T GCD(T a, T b) {
    T min_v = min(a, b);
    T max_v = max(a, b);

    while (min_v) {
        T temp = max_v % min_v;
        max_v = min_v;
        min_v = temp;
    }

    return max_v;
}


template<typename T>
T LCM(T a, T b) {
    return (a*b) / gcd(a, b);
}


template<typename T>
T fastExpPow(T base, T exp, T mod) {
    T res = 1;

    while (exp) {
        if (exp&1) {
            res *= base;
            res %= mod;
        }

        exp >>= 1;
        base *= base;
        base %= mod;
    }

    return res % mod;
}

/*#################################################################################################################
###################################################################################################################
###################################################################################################################
#################################################################################################################*/

#define SIZE 100010

int N;
int perm[SIZE], counts[SIZE], positions[SIZE], larg[SIZE][5][5];
list<int> lst;


int main() {
    scanf("%d", &N);

    FOR (i, 1, N) {
        scanf("%d", perm + i);
        positions[perm[i]] = i;
    }

    FOR (i, 1, N) {
        int cnt = 0;
        list<int>::reverse_iterator itr = lst.rbegin();
        vector<int> toDelete;

        while (itr != lst.rend()) { 
            if (*itr > perm[i]) {
                larg[perm[i]][0][cnt] = positions[*itr];
                
                if (++cnt == 2) {
                    break;
                }
            } else if (*itr < perm[i]) {
                if (++counts[*itr] == 2) {
                    toDelete.pb(*itr);
                }
            }

            ++itr;
        }
        
        reverse(ALL(toDelete));
        int pos = 0;

        for (list<int>::const_iterator itr = lst.begin(); itr != lst.end() && pos < (int)toDelete.size();) {
            if (*itr == toDelete[pos]) {
                itr = lst.erase(itr);
                ++pos;
            } else {
                ++itr;
            }
        }
        
        lst.pb(perm[i]);
    }
    
    lst.clear();
    ms(counts, 0);

    for (int i = N; i >= 1; --i) {
        int cnt = 0;
        list<int>::reverse_iterator itr = lst.rbegin();
        vector<int> toDelete;

        while (itr != lst.rend()) { 
            if (*itr > perm[i]) {
                larg[perm[i]][1][cnt] = positions[*itr];
                
                if (++cnt == 2) {
                    break;
                }
            } else if (*itr < perm[i]) {
                if (++counts[*itr] == 2) {
                    toDelete.pb(*itr);
                }
            }

            ++itr;
        }
        
        reverse(ALL(toDelete));
        int pos = 0;

        for (list<int>::const_iterator itr = lst.begin(); itr != lst.end() && pos < (int)toDelete.size();) {
            if (*itr == toDelete[pos]) {
                itr = lst.erase(itr);
                ++pos;
            } else {
                ++itr;
            }
        }
        
        lst.pb(perm[i]);
    }
    
    LL answer = 0;

    FOR (i, 1, N) {
        int c1 = larg[perm[i]][0][0];
        int f1 = larg[perm[i]][0][1];
        int c2 = larg[perm[i]][1][0];
        int f2 = larg[perm[i]][1][1];

        if (c2 == 0) {
            c2 = N + 1;
        }
        
        if (f2 == 0) {
            f2 = N + 1;
        }
        
        answer += (LL)perm[i] * ((LL)(c1 - f1) * (LL)(c2 - i) + (LL)(f2 - c2) * (LL)(i - c1));
    }
    
    printf("%lld\n", answer);
    return 0;
}

Measured memory_bytes: 14208