#include 
    
     using namespace std;typedef long long ll;int read(){    int out=0,sgn=1;    char jp=getchar();    while(jp!='-' && (jp<'0' || jp>'9'))        jp=getchar();    if(jp=='-')        sgn=-1,jp=getchar();    while(jp>='0' && jp<='9')        out=out*10+jp-'0',jp=getchar();    return out*sgn;}const int MAXN=1e5+10;struct v2{    double x,y;    v2(double x=0,double y=0):x(x),y(y) {}    friend double operator * (const v2 &a,const v2 &b)    {        return a.x*b.y-a.y*b.x;    }    v2 operator + (const v2 &rhs) const    {        return v2(x+rhs.x,y+rhs.y);    }    v2 operator - (const v2 &rhs) const    {        return v2(x-rhs.x,y-rhs.y);    }    v2 operator ^ (const double &lambda) const    {        return v2(x*lambda,y*lambda);    }    double modulus()    {        return sqrt(x*x+y*y);    }    double angle()    {        return atan2(y,x);    }    bool operator < (const v2 &rhs) const    {        return x==rhs.x?y
     
      
       0;}v2 Intersection(Line a,Line b){    v2 u=a.p-b.p;    double t=(b.v*u)/(a.v*b.v);    return a.p+(a.v^t);}int head,tail,n;//n-the num of LinesLine q[MAXN],L[MAXN];v2 p[MAXN];void Hpi(){    sort(L+1,L+1+n);    q[head=tail=1]=L[1];    for(int i=2;i<=n;++i)    {        while(head