#include<iostream>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<string.h>
using namespace std;
const double PI=3.14159265;
const double EP=1E-10;
const double INF=1E200;
class po
{
public:
double x;
double y;
public:
double operator * (po p)
{
return x*p.x+y*p.y;
}
double operator % (po p)
{
return x*p.y-p.x*y;
}
po operator -(po p1)
{
po p;
p.x=x-p1.x;
p.y=y-p1.y;
return p;
}
po operator +(po p1)
{
po p;
p.x=x+p1.x;
p.y=y+p1.y;
return p;
}
};
class li
{
public:
po s;
po e;
}l[4000+100];
int ge[400];
bool one(int i,int w)
{
if(!(min(l[i].s.x,l[i].e.x)<=max(l[w].s.x,l[w].e.x)))return 0;
if(!(min(l[w].e.x,l[w].s.x)<=max(l[i].e.x,l[i].s.x)))return 0;
if(!(min(l[i].s.y,l[i].e.y)<=max(l[w].s.y,l[w].e.y)))return 0;
if(!(min(l[w].e.y,l[w].s.y)<=max(l[i].e.y,l[i].s.y)))return 0;
return 1;
}
bool two(int i,int w)
{
po p1=l[i].s,
p2=l[i].e,
p3=l[w].s,
p4=l[w].e;
if(!(((p1-p3)%(p4-p3))*((p2-p3)%(p4-p3))<=0))return 0;
if(!(((p3-p1)%(p2-p1))*((p4-p1)%(p2-p1))<=0))return 0;
return 1;
}
int main()
{
int t;
while(scanf("%d",&t)!=EOF)
{
memset(l,0,sizeof(l));
int res=0;
int rr=0;
int i,q,w;
for(i=1;i<=t;i++)
{
po p[1000];
int n;
scanf("%d",&n);
ge[rr++]=res;
for(q=1;q<=n;q++)
{
scanf("%lf%lf",&p[q].x,&p[q].y);
if(q!=1)
{
l[res].s=p[q-1];
l[res++].e=p[q];
}
}
}
ge[rr++]=res;
int zi=1;
for(i=0;i<=rr-2;i++)
{
for(w=ge[i];w<=ge[i+1]-1;w++)
for(q=ge[i+1];q<=res-1;q++)
{
if(one(w,q)&&two(w,q))zi=0;
}
}
if(zi==0)printf("Yes\n");
else printf("No\n");
}
return 0;
}