#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename T >
struct edge {
  int src, to;
  T cost;

  edge(int to, T cost) : src(-1), to(to), cost(cost) {}

  edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

  edge &operator=(const int &x) {
    to = x;
    return *this;
  }

  operator int() const { return to; }
};

template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
template< typename T >
using Matrix = vector< vector< T > >;

int chromatic_number(const Matrix< bool > &g) {
  int N = (int) g.size();
  vector< int > es(N);
  for(int i = 0; i < g.size(); i++) {
    for(int j = 0; j < g.size(); j++) {
      es[i] |= g[i][j] << j;
    }
  }
  int ret = N;
  for(int d : {7, 11, 21}) {
    int mod = 1e9 + d;
    vector< int > ind(1 << N), aux(1 << N, 1);
    ind[0] = 1;
    for(int S = 1; S < 1 << N; S++) {
      int u = __builtin_ctz(S);
      ind[S] = ind[S ^ (1 << u)] + ind[(S ^ (1 << u)) & ~es[u]];
    }
    for(int i = 1; i < ret; i++) {
      int64_t all = 0;
      for(int j = 0; j < 1 << N; j++) {
        int S = j ^(j >> 1);
        aux[S] = (1LL * aux[S] * ind[S]) % mod;
        all += j & 1 ? aux[S] : mod - aux[S];
      }
      if(all % mod) ret = i;
    }
  }
  return ret;
}


const double EPS = 1e-10;

struct Point {
  double x, y;

  Point() {}

  Point(double x, double y) : x(x), y(y) {}

  Point operator+(Point p) { return Point(x + p.x, y + p.y); }

  Point operator-(Point p) { return Point(x - p.x, y - p.y); }

  Point operator*(double k) { return Point(x * k, y * k); }

  Point operator/(double k) { return Point(x / k, y / k); }
};

typedef Point Vector;
typedef vector< Point > Polygon;

double norm(Vector a) {
  return a.x * a.x + a.y * a.y;
}

double abs(Vector a) {
  return sqrt(norm(a));
}

double cross(Vector a, Vector b) {
  return a.x * b.y - a.y * b.x;
}

bool calc(Point a1, Point a2, Point b1, Point b2) {
  if(abs(cross(a2 - a1, b1 - a1)) > EPS) return 0;
  if(abs(cross(a2 - a1, b2 - a1)) > EPS) return 0;
  double ml = 0;
  ml = max(ml, abs(a1 - a2));
  ml = max(ml, abs(a1 - b1));
  ml = max(ml, abs(a1 - b2));
  ml = max(ml, abs(a2 - b1));
  ml = max(ml, abs(a2 - b2));
  ml = max(ml, abs(b1 - b2));
  return (ml + EPS < abs(a1 - a2) + abs(b1 - b2));
}

signed main() {

  int n;
  while(cin >> n, n) {
    vector< Polygon > p(n);
    vector< string > name(n);
    map< string, int > m;
    for(int i = 0; i < n; i++) {
      cin >> name[i];
      if(!m.count(name[i])) {
        int k = m.size();
        m[name[i]] = k;
      }
      int x, y;
      while(cin >> x, ~x) {
        cin >> y;
        p[i].push_back(Point(x, y));
      }
    }

    Matrix< bool > G(m.size(), vector< bool >(m.size()));
    for(int i = 0; i < n; i++) {
      for(int j = i + 1; j < n; j++) {
        if(name[i] == name[j]) continue;
        for(int k = 0; k < (int) p[i].size(); k++) {
          for(int l = 0; l < (int) p[j].size(); l++) {
            if(calc(p[i][k], p[i][(k + 1) % p[i].size()],
                    p[j][l], p[j][(l + 1) % p[j].size()])) {
              G[m[name[j]]][m[name[i]]] = true;
              G[m[name[i]]][m[name[j]]] = true;
            }
          }
        }
      }
    }
    cout << chromatic_number(G) << endl;
  }
  return 0;
}



Measured memory_bytes: 3172