#include <iostream>
#include <fstream>
#include <complex>
#include <map>
#include <vector>
using namespace std;

typedef complex<double> cplx;
typedef pair<cplx,cplx> edge;

double epsilon = 0.00001;

bool operator<(const cplx& a,const cplx& b){
  if(real(a-b))
    return real(a-b)<0;
  return imag(a-b)<0;
}

int adj(cplx a, cplx u, cplx b, cplx v){
  if(norm(u)<=epsilon || norm(v)<=epsilon)
    return 0;
  cplx d = (b-a)/u;
  cplx z = v/u;
  if(abs(imag(d))>=epsilon || abs(imag(d+z)) >=epsilon)
    return 0;
  double x1 = min(real(d),real(d+z));
  double x2 = max(real(d),real(d+z));
  if(x1>=1 || x2 <=0)
    return 0;
  return 1;
}

bool adj_poly(vector<edge> a,vector<edge> b){
  for(int i=0;i<a.size();i++){
    for(int j=0;j<b.size();j++){
      if(adj(a[i].first,a[i].second,b[j].first,b[j].second))
	return true;
    }
  }
  return false;
}

bool rec(bool (*tbl)[101],int n,int rest,vector<int> &hist,int cur)
{
  if (cur==n) return true;
  for (int c=0;c<rest;c++){
    bool can_use=true;
    for(int i=0;i<cur;i++){
      if (!tbl[i][cur]) continue;
      if (hist[i]==c){
	can_use=false;
	break;
      }
    }
    if (can_use){
      hist[cur]=c;
      if (rec(tbl,n,rest,hist,cur+1))
	return true;
    }
  }
  return false;
}

int solve(bool (*tbl)[101],int n)
{
  vector<int> hist(101,-1);
  for (int i=0;;i++){
    if (rec(tbl,n,i,hist,0)) return i;
  }

  // maxtoru
  /*
  int m=0;
  for (int i=0;i<n;i++){
    for (int j=0;j<n;j++){
      tbl[i][j]
    }
  }
  */
}

int main()
{
  ifstream cin("G.txt");
  /*
  cout << adj(cplx(0,0) , cplx(10,0)  ,cplx(10,0)  ,cplx(-10,0)  ) << endl;
  cout << adj(cplx(2,2) , cplx(4,4)  ,cplx(7,7)  ,cplx(-3,-3)  ) << endl;
  cout << adj(cplx(2,2) , cplx(3,3) , cplx(-1,-1) , cplx(12,12)  ) << endl;
  */
  for(;;){
     int n;
     cin >> n;
     if(n==0)break;
     map<string,vector<edge> > data;
     for(int i=0;i<n;i++){
       string name;
       double x,y;
       cin >> name;
       vector<cplx> vert;
       for(;;){
	 cin >> x;
	 if(x<0) break;
	 cin >> y;
	 vert.push_back(cplx(x,y));
       }
       for(int i=0;i<vert.size();i++){
	 int j = (i+1)%vert.size();
	 data[name].push_back(edge(vert[i],vert[j]-vert[i]));
       }
     }
     bool mat[101][101]={0};
     int ii=0,jj=0;
     for(map<string,vector<edge> >::iterator it=data.begin();
	 it!=data.end();it++,ii++){
       jj=0;
       for(map<string,vector<edge> >::iterator jt=data.begin();
	   jt!=data.end();jt++,jj++){
	 if(ii==jj)
	   mat[ii][jj]=1;
	 else
	   mat[ii][jj]=adj_poly(it->second,jt->second);
       }
     }
     /*
     for(int y = 0;y<data.size();y++){
       for(int x = 0;x<data.size();x++){
	 cout << mat[y][x] ;
       }
       cout << endl;
     }
     */
     cout<<solve(mat,n)<<endl;
  }
  return 0;
}