#include <bits/stdc++.h>
using namespace std;

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

    int N; cin >> N;
    vector<int> A(N);
    for(auto &a : A) cin >> a;
    sort(A.begin(),A.end());

    long long answer = 0,aoi = 0,akane = 0;
    map<int,long long> M;
    priority_queue<int,vector<int>,greater<>> Q;
    for(auto a : A){
        if(M.count(a) == false) Q.push(a);
        while(Q.size()){
            int b = Q.top();  
            if(b+b <= a) Q.pop(),aoi -= M[b]*(M[b]-1)/2;
            else break;
        }
        answer += aoi; answer += (akane-M[a])*M[a];
        aoi += M[a]; M[a]++; akane++;
    }
    for(auto [k,v] : M) answer -= v*(v-1)*(v-2)/6;
    cout << answer << endl;
}