import java.util.*; import java.nio.*; public class Main{ public static void main(String[] args){ Solve s=new Solve();s.solve();s.exit(); } } class Solve{ class pos{ int x,y; pos(int x,int y){ this.x=x; this.y=y; } } public Scanner sc=new Scanner(System.in); void exit(){ sc.close(); } void swap(int[] v,int x,int y){ v[x]^=v[y]; v[y]^=v[x]; v[x]^=v[y]; } public class comp implements Comparator { int _pos(pos v){ if (v.y < 0) return -1; if (v.y == 0 && 0 <= v.x) return 0; return 1; } @Override public int compare(pos s,pos t){ if(_pos(s)!=_pos(t))return _pos(s)<_pos(t)?1:-1; else return 0q=new ArrayList<>(); for(int j=0;j=0)r++; ans+=(r-l)*(x[i]*(y[i]+q.get(j).y)-y[i]*(x[i]+q.get(j).x)); } } System.out.println(ans); } }