#include <bits/stdc++.h>
//typedef
//-------------------------#include <bits/stdc++.h>

const double pi = 3.141592653589793238462643383279;

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s)
{
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x)
{
  ostringstream sout;
  sout << x;
  return sout.str();
}
inline int readInt()
{
  int x;
  scanf("%d", &x);
  return x;
}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

//repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()

typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;

#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)

class UnionFind
{
public:
  vector<int> par;
  vector<int> siz;

  UnionFind(int sz_) : par(sz_), siz(sz_, 1)
  {
    for (ll i = 0; i < sz_; ++i)
      par[i] = i;
  }
  void init(int sz_)
  {
    par.resize(sz_);
    siz.assign(sz_, 1LL);
    for (ll i = 0; i < sz_; ++i)
      par[i] = i;
  }

  int root(int x)
  {
    while (par[x] != x)
    {
      x = par[x] = par[par[x]];
    }
    return x;
  }

  bool merge(int x, int y)
  {
    x = root(x);
    y = root(y);
    if (x == y)
      return false;
    if (siz[x] < siz[y])
      swap(x, y);
    siz[x] += siz[y];
    par[y] = x;
    return true;
  }

  bool issame(int x, int y)
  {
    return root(x) == root(y);
  }

  int size(int x)
  {
    return siz[root(x)];
  }
};

ll modPow(ll x, ll n, ll mod = MOD)
{
  ll res = 1;
  while (n)
  {
    if (n & 1)
      res = (res * x) % mod;

    res %= mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}

#define SIEVE_SIZE 5000000 + 10
bool sieve[SIEVE_SIZE];
void makeSieve()
{
  for (int i = 0; i < SIEVE_SIZE; ++i)
    sieve[i] = true;
  sieve[0] = sieve[1] = false;
  for (int i = 2; i * i < SIEVE_SIZE; ++i)
    if (sieve[i])
      for (int j = 2; i * j < SIEVE_SIZE; ++j)
        sieve[i * j] = false;
}

bool isprime(ll n)
{
  if (n == 0 || n == 1)
    return false;
  for (ll i = 2; i * i <= n; ++i)
    if (n % i == 0)
      return false;
  return true;
}

const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit()
{
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++)
  {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}

// 二項係数計算
long long COM(int n, int k)
{
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

long long extGCD(long long a, long long b, long long &x, long long &y)
{
  if (b == 0)
  {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extGCD(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
// 負の数にも対応した mod (a = -11 とかでも OK)
inline long long mod(long long a, long long m)
{
  return (a % m + m) % m;
}

// 逆元計算 (ここでは a と m が互いに素であることが必要)
long long modinv(long long a, long long m)
{
  long long x, y;
  extGCD(a, m, x, y);
  return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので
}
ll GCD(ll a, ll b)
{

  if (b == 0)
    return a;
  return GCD(b, a % b);
}

typedef vector<ll> vec;
typedef vector<vec> mat;

mat mul(mat &A, mat &B)
{
  mat C(A.size(), vec((int)B[0].size()));
  for (int i = 0; i < A.size(); ++i)
  {
    for (int k = 0; k < B.size(); ++k)
    {
      for (int j = 0; j < B[0].size(); ++j)
      {
        C[i][j] = (C[i][j] + A[i][k] % MOD * B[k][j] % MOD) % MOD;
      }
    }
  }
  return C;
}
mat matPow(mat A, ll n)
{
  mat B(A.size(), vec((int)A.size()));

  for (int i = 0; i < A.size(); ++i)
  {
    B[i][i] = 1;
  }

  while (n > 0)
  {
    if (n & 1)
      B = mul(B, A);
    A = mul(A, A);
    n >>= 1;
  }
  return B;
}
const int UP = 0;
const int FRONT = 1;
const int RIGHT = 2;
const int LEFT = 3;
const int BACK = 4;
const int DOWN = 5;
struct Dice
{

  vector<int> d;

  Dice(vector<int> v, int N = 6)
  {
    d.resize(N);
    for (int i = 0; i < N; i++)
    {
      d[i] = v[i];
    }
  }

  Dice(int t, int f, int N = 6)
  {
    d.resize(N);
    d[UP] = t;
    d[DOWN] = 7 - d[UP];
    d[FRONT] = f;
    d[BACK] = 7 - d[FRONT];

    if (t == 1)
    {
      if (f == 2)
      {
        d[RIGHT] = 3;
      }
      else if (f == 3)
      {
        d[RIGHT] = 5;
      }
      else if (f == 4)
      {
        d[RIGHT] = 2;
      }
      else if (f == 5)
      {
        d[RIGHT] = 4;
      }
    }
    else if (t == 2)
    {
      if (f == 1)
      {
        d[RIGHT] = 4;
      }
      else if (f == 3)
      {
        d[RIGHT] = 1;
      }
      else if (f == 6)
      {
        d[RIGHT] = 3;
      }
      else if (f == 4)
      {
        d[RIGHT] = 6;
      }
    }
    else if (t == 3)
    {
      if (f == 1)
      {
        d[RIGHT] = 2;
      }
      else if (f == 2)
      {
        d[RIGHT] = 6;
      }
      else if (f == 5)
      {
        d[RIGHT] = 1;
      }
      else if (f == 6)
      {
        d[RIGHT] = 5;
      }
    }
    else if (t == 4)
    {
      if (f == 1)
      {
        d[RIGHT] = 5;
      }
      else if (f == 2)
      {
        d[RIGHT] = 1;
      }
      else if (f == 5)
      {
        d[RIGHT] = 6;
      }
      else if (f == 6)
      {
        d[RIGHT] = 2;
      }
    }
    else if (t == 5)
    {
      if (f == 1)
      {
        d[RIGHT] = 3;
      }
      else if (f == 3)
      {
        d[RIGHT] = 6;
      }
      else if (f == 4)
      {
        d[RIGHT] = 1;
      }
      else if (f == 6)
      {
        d[RIGHT] = 4;
      }
    }
    else if (t == 6)
    {
      if (f == 2)
      {
        d[RIGHT] = 4;
      }
      else if (f == 3)
      {
        d[RIGHT] = 2;
      }
      else if (f == 4)
      {
        d[RIGHT] = 5;
      }
      else if (f == 5)
      {
        d[RIGHT] = 3;
      }
    }
    d[LEFT] = 7 - d[RIGHT];
  }

  void rotate(char s)
  {
    vector<int> tmp = d;
    if (s == 'S')
    {
      d[0] = tmp[4];
      d[1] = tmp[0];
      d[5] = tmp[1];
      d[4] = tmp[5];
    }

    if (s == 'E')
    {
      d[0] = tmp[3];
      d[2] = tmp[0];
      d[5] = tmp[2];
      d[3] = tmp[5];
    }

    if (s == 'W')
    {
      d[0] = tmp[2];
      d[3] = tmp[0];
      d[5] = tmp[3];
      d[2] = tmp[5];
    }

    if (s == 'N')
    {
      d[0] = tmp[1];
      d[1] = tmp[5];
      d[5] = tmp[4];
      d[4] = tmp[0];
    }
  }

  void spin()
  {
    vector<int> tmp = d;
    d[1] = tmp[2];
    d[2] = tmp[4];
    d[4] = tmp[3];
    d[3] = tmp[1];
  }

  int operator[](const int &k)
  {
    return d[k];
  }

  bool issame(Dice &d2)
  {
    bool res = true;

    for (int i = 0; i < 6; i++)
    {
      if (d[i] != d2[i])
        res = false;
    }

    return res;
  }
};

//i, jの高さkの値
int arr[210][210];
int h[210][210];
int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);

  int n;
  vector<int> res;
  while (cin >> n, n)
  {
    vector<double> x(n), y(n), r(n), c(n);

    vector<int> mask;
    REP(i, n)
    {
      cin >> x[i] >> y[i] >> r[i] >> c[i];
      c[i]--;
    }

    for (int i = 0; i < n; i++)
    {
      int t = 0;
      for (int j = 0; j < i; j++)
      {
        double d = sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));

        if (r[i] + r[j] > d)
        {
          t |= (1 << j);
        }
      }
      mask.push_back(t);
    }

    vector<int> dp(1 << n, -1);
    dp[0] = 0;
    int ans = 0;
    for (int bit = 0; bit < (1 << n); bit++)
    {
      if (dp[bit] == -1)
        continue;
      map<int, vector<int>> mp;
      for (int i = 0; i < n; i++)
      {
        if ((bit & (1 << i)) == 0 && (mask[i] & bit) == mask[i])
        {
          mp[c[i]].push_back(i);
        }
      }

      for (auto e : mp)
      {
        if (e.second.size() <= 1)
          continue;

        for (int i = 0; i < e.second.size(); i++)
        {
          int x = e.second[i];
          for (int j = i + 1; j < e.second.size(); j++)
          {
            int y = e.second[j];
            int t = 0;
            t |= (1 << x);
            t |= (1 << y);
            dp[bit | t] = max(dp[bit | t], dp[bit] + 2);
            ans = max(ans, dp[bit | t]);
          }
        }
      }
    }
    //res.push_back(ans);
    cout << ans << endl;
  }

  return 0;
}



Measured memory_bytes: 68572