#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

#include <map>
#include <deque>

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> a(n);
    rep(i,0,n) {
        cin >> a[i];
    }
    ll ans = 0;
    rep(k,1,2001) {
        map<int, deque<int>> m;
        rep(i,0,n){
            m[a[i]].emplace_back(i);
        }
        rep (t,0,n) {
            int a1 = a[t];
            m[a1].pop_front();
            int a2 = a1 + 10 + k;
            int a3 = a1 + 10;
            int a4 = a2 + 1;
            for (auto i : m[a3]) {
                auto v1 = m[a2];
                auto v2 = m[a4];
                ll t1 = lower_bound(v1.begin(), v1.end(), i) - v1.begin();
                ll t2 = v2.end() - lower_bound(v2.begin(), v2.end(), i);
                ans += t1 * t2;
            }
        }
    }
    print(ans);
    return 0;
}