helppppppppppppppppppppppppppppppppppp

#include <bits/stdc++.h>

#define int long long

using namespace std;

const int N = 1e6 + 5;

int a[N];

main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
  
  int n, ans = 0;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  
  sort(a + 1, a + n + 1);

  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
      if (a[i] == a[j]) continue;
      int l = lower_bound(a + i + 1, a + j, ceil((2 * a[i] + a[j]) / 3.0)) - a;
      int r = upper_bound(a + i + 1, a + j, (a[i] + a[j]) / 2) - a - 1;
      ans += r - l + 1;
    } 
  }
  cout << ans;

  return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;
const int N=1e6+5;
int a[N];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,r=0;
    cin>>n;
    for(int i=1;i<=n;++i)cin>>a[i];
    sort(a+1,a+n+1);
    for(int i=1;i<=n;++i){
        for(int j=i+1;j<=n;++j){
            if(a[i]==a[j])continue;
            int l=(2*a[i]+a[j]+2)/3;
            int u=(a[i]+a[j])/2;
            for(int k=i+1;k<j;++k){
                if(a[k]>=l && a[k]<=u)r++;
            }
        }
    }
    cout<<r;
    return 0;
}