#include <cmath>
#include <cstdio>
#include <algorithm>
const double eps=1e-9;
inline int dcmp(const double &a){
    if(fabs(a)<eps) return 0;
    return a<0?-1:1;
}
struct line{
    double k,b;
    int id;
}p[50050],stk[50050]; int tp,n;
inline bool cmp(const line &a,const line &b){
    if(!dcmp(a.k-b.k)) return a.b>b.b;
    return a.k>b.k;
}
inline bool cmp2(const line &a,const line &b){
    return a.id<b.id;
}
void halfPlanesIntersection(){
    stk[++tp]=p[0];
    for(int i=1;i<n;++i){
        if(!dcmp(p[i].k-stk[tp].k)) continue;
        while(tp>1&&dcmp((stk[tp].b-stk[tp-1].b)*(stk[tp-1].k-p[i].k)+(stk[tp-1].k-stk[tp].k)*(stk[tp-1].b-p[i].b))<1) --tp;
        stk[++tp]=p[i];
    }
}
int main(){
    scanf("%d",&n);
    for(int i=0;i<n;++i){
        scanf("%lf%lf",&p[i].k,&p[i].b);
        p[i].id=i+1;
    }
    std::sort(p, p+n, cmp);
    halfPlanesIntersection();
    std::sort(stk+1, stk+tp+1, cmp2);
    for(int i=1;i<=tp;++i)
        printf("%d ",stk[i].id);
}

#include <cmath>
#include <cstdio>
#include <algorithm>
const int N=101010;
const double eps=1e-9;
inline int dcmp(const double &a){
    if(fabs(a)<eps) return 0;
    return a<0?-1:1;
}
struct vec{
    double x,y;
    vec(double X=0,double Y=0):x(X),y(Y){}
}pt[N],yM; int pcnt;
inline vec operator-(const vec &a,const vec &b){
    return vec(a.x-b.x,a.y-b.y);
}
inline double operator*(const vec &a,const vec &b){
    return a.x*b.y-a.y*b.x;
}
struct line{
    vec a,b;
    line(){}
    line(vec X,vec Y):a(X),b(Y){}
}p[N],dq[N]; int tp,bt,n; //双端队列
inline bool aboveX(const line &a) //是否在x轴上方
{
    if(!dcmp(a.b.y-a.a.y)) return dcmp(a.b.x-a.a.x)>0;
    return dcmp(a.b.y-a.a.y)>0;
}
inline bool cmpa(const line &a,const line &b){
    if(aboveX(a)!=aboveX(b)) return aboveX(a);
    if(!dcmp((a.b-a.a)*(b.b-b.a))) 
        return dcmp((a.b-a.a)*(b.b-a.a))<0;
    return dcmp((a.b-a.a)*(b.b-b.a))>0;
}
inline vec getLinesIntersect(const line &a,const line &b){
    double a1,a2,b1,b2,c1,c2,d;
    a1=a.b.y-a.a.y; b1=a.a.x-a.b.x; c1=a.a*a.b;
    a2=b.b.y-b.a.y; b2=b.a.x-b.b.x; c2=b.a*b.b;
    d=a1*b2-a2*b1;
    return vec((b2*c1-b1*c2)/d,(a1*c2-a2*c1)/d);
}
inline bool pd(const line &a,const line &b,const line &c){
    //判断直线a和直线b的交点是否在c左边(在半平面内)
    vec p=getLinesIntersect(a,b);
    return dcmp((p-c.a)*(c.b-c.a))>-1; //true表示不在半平面内
}
void halfPlaneIntersection(){
    int i,j; vec t;
    for(i=0,j=0;i<n;++i)
        if(dcmp((p[i].b-p[i].a)*(p[j].b-p[j].a)))
            p[++j]=p[i];
    n=j+1; //去掉极角相同
    dq[bt]=p[0];
    dq[++tp]=p[1]; //开始两条直线入队
    for(int i=2;i<n;++i){
        while(tp>bt&&pd(dq[tp],dq[tp-1],p[i])) --tp;
        while(bt<tp&&pd(dq[bt],dq[bt+1],p[i])) ++bt;
        dq[++tp]=p[i];
    }
    while(tp>bt&&pd(dq[tp],dq[tp-1],dq[bt])) --tp;
    while(bt<tp&&pd(dq[bt],dq[bt+1],dq[tp])) ++bt;
    dq[++tp]=dq[bt]; //已经保存好绕一圈的直线了
  
    //确定半平面交部分的顶点
    for(i=bt;i<tp;++i,++pcnt)
        pt[pcnt]=getLinesIntersect(dq[i],dq[i+1]);
}
double polyArea(double s=0){
    if(pcnt<3) return 0;
    pt[pcnt]=pt[0];
    for(int i=0;i<pcnt;++i)
        s=s+pt[i]*pt[i+1];
    return 0.5*fabs(s);
}
int main(){
    int T,w=0; 
    scanf("%d",&T);
    while(T--){
        int ps; scanf("%d",&ps);
        for(int i=1;i<=ps;++i) scanf("%lf%lf",&pt[i].x,&pt[i].y);
        pt[0]=pt[ps];
        for(int i=0;i<ps;++i) p[n].a=pt[i],p[n++].b=pt[i+1];
    }
    std::sort(p,p+n,cmpa);
    halfPlaneIntersection();
    double area=polyArea();
    printf("%.3lf",area);
}