0pts求条

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=5e3+10;
const ll MOD=20060723;
ll n,a[N],g[N][N],f[N];
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	ll ans=0;
	g[0][0]=1;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=i;j++){
			g[i][j]=g[i-1][j];
			if(j>0)g[i][j]+=g[i-1][j-1];
			g[i][j]%=MOD;
			if(j>0)f[i]+=g[i][j]*(j+2);
		}   
	}
	for(int i=1;i<=n;i++){
		for(int j=2;j<i;j++){
			ll l=0,r=j+1;
			while(l+1<r){
				ll mid=(l+r)/2;
				if(a[mid]+a[j]<=a[i])l=mid;
				else r=mid;
			}
			if(r>=j)continue;
			ans=ans+((f[j-1]-f[l]+MOD)%MOD)*a[i];
			ans%=MOD;
		}
	}
	cout<<ans;
	return 0;
}