#include using namespace std; #define ALL(x) begin(x),end(x) #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<bool chmax(T &a,const T &b){if(abool chmin(T &a,const T &b){if(b ostream &operator<<(ostream &os,const vector&v){ for(int i=0;i<(int)v.size();i++) os< istream &operator>>(istream &is,vector&v){ for(T &x:v)is>>x; return is; } template struct ModInt{ long long x; ModInt():x(0){} ModInt(long long y):x(y>=0?y%Mod:(Mod-(-y)%Mod)%Mod){} ModInt &operator+=(const ModInt &p){ if((x+=p.x)>=Mod) x-=Mod; return *this; } ModInt &operator-=(const ModInt &p){ if((x+=Mod-p.x)>=Mod)x-=Mod; return *this; } ModInt &operator*=(const ModInt &p){ x=(int)(1ll*x*p.x%Mod); return *this; } ModInt &operator/=(const ModInt &p){ (*this)*=p.inverse(); return *this; } ModInt operator-()const{return ModInt(-x);} ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;} ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;} ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;} ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;} bool operator==(const ModInt &p)const{return x==p.x;} bool operator!=(const ModInt &p)const{return x!=p.x;} ModInt inverse()const{ int a=x,b=Mod,u=1,v=0,t; while(b>0){ t=a/b; swap(a-=t*b,b);swap(u-=t*v,v); } return ModInt(u); } ModInt pow(long long n)const{ ModInt ret(1),mul(x); while(n>0){ if(n&1) ret*=mul; mul*=mul;n>>=1; } return ret; } friend ostream &operator<<(ostream &os,const ModInt &p){return os<>(istream &is,ModInt &a){long long t;is>>t;a=ModInt(t);return (is);} static int get_mod(){return Mod;} }; using mint=ModInt; template struct comcalc{ vector fact,finv,inv; comcalc():fact(MAX),finv(MAX),inv(MAX){ fact[0]=mint(1),fact[1]=mint(1),finv[0]=mint(1),finv[1]=mint(1),inv[1]=mint(1); for(int i=2;ir)return mint(0); mint ret=mint(r+1)*com(n+r+1,r+1)-mint(l)*com(l+n,l); ret/=mint(n+1); return ret; } }; using ld=long double; const ld pi=acosl(-1); signed main(){ int n;cin>>n; vector X(n),Y(n); rep(i,n) cin>>X[i]>>Y[i]; mint res=0; rep(o,n){ vector> v; for(int i=o+1;i a,pair b){ return atan2(ld(a.second),ld(a.first))> l,r; ll lsx=0,lsy=0,rsx=0,rsy=0; auto pf_l=[&](){ lsx-=l.front().first,lsy-=l.front().second; auto ret=l.front();l.pop_front(); return ret; }; auto pb_l=[&](pair p){ lsx+=p.first,lsy+=p.second; l.push_back(p); return ; }; auto pf_r=[&](){ rsx-=r.front().first,rsy-=r.front().second; auto ret=r.front();r.pop_front(); return ret; }; auto pb_r=[&](pair p){ rsx+=p.first,rsy+=p.second; r.push_back(p); return ; }; auto check=[&](pair a,pair b){ ld ar=atan2(a.second,a.first); ld br=atan2(b.second,b.first); br-=ar; while(br<=0) br+=2*pi; while(br>=2*pi) br-=pi; // cout<<"("< cur; if(l.empty()) cur=pf_r(); else cur=pf_l(); while(!r.empty() and check(cur,r.front())){ auto p=pf_r(); pb_l(p); } // cout<<"cur : "<