#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

bool circle_overlapping(int y1, int x1, int r1, int y2, int x2, int r2) {
    int dx = x2 - x1;
    int dy = y2 - y1;
    int d = r1 + r2;
    return dx * dx + dy * dy < d * d;
}

bool can_remove(int idx1, int idx2, const vector<tuple<int, int, int, int>> &v, vector<int> idx_list) {
    int x1, y1, r1, c1, x2, y2, r2, c2;
    tie(x1, y1, r1, c1) = v[idx1];
    tie(x2, y2, r2, c2) = v[idx2];

    if (c1 != c2) {
        return false;
    }

    FOE(i, idx_list) {
        if (i == idx1) {
            break;
        }
        int x3, y3, r3, c3;
        tie(x3, y3, r3, c3) = v[i];
        if (circle_overlapping(y1, x1, r1, y3, x3, r3)) {
            return false;
        }
    }
    FOE(i, idx_list) {
        if (i == idx2) {
            break;
        }
        int x3, y3, r3, c3;
        tie(x3, y3, r3, c3) = v[i];
        if (circle_overlapping(y2, x2, r2, y3, x3, r3)) {
            return false;
        }
    }

    return true;
}

int main() {
    cin.tie(0);
	ios::sync_with_stdio(false);

    while (true) {
        int N;
        cin >> N;
        if (N == 0) {
            break;
        }
        vector<tuple<int, int, int, int>> v;
        FOR(i, 0, N) {
            int x, y, r, c;
            cin >> x >> y >> r >> c;
            v.emplace_back(make_tuple(x, y, r, c));
        }

        int ans = 0;
        vector<bool> dp(1LL << (N + 1), false);
        dp[0] = true;
        FOR(b, 0, 1LL << (N + 1)) {
            if (not dp[b]) {
                continue;
            }

            vector<int> idx_list;
            FOR(i, 0, N) {
                if (not (b & (1 << i))) {
                    idx_list.emplace_back(i);
                }
            }

            vector<int> vv;
            FOR(i, 0, idx_list.size()) {
                int x1, y1, r1, c1;
                tie(x1, y1, r1, c1) = v[idx_list[i]];
                bool ok = true;
                for(int j = i - 1; j >= 0; --j) {
                    int x2, y2, r2, c2;
                    tie(x2, y2, r2, c2) = v[idx_list[j]];
                    if (circle_overlapping(y1, x1, r1, y2, x2, r2)) {
                        ok = false;
                        break;
                    }
                }
                if (ok) {
                    vv.emplace_back(idx_list[i]);
                }
            }

            FOR(i, 0, vv.size()) {
                FOR(j, i + 1, vv.size()) {
                    int x1, y1, r1, c1, x2, y2, r2, c2;
                    tie(x1, y1, r1, c1) = v[vv[i]];
                    tie(x2, y2, r2, c2) = v[vv[j]];
                    if (c1 == c2) {
                        int key = (b | (1 << vv[i]) | (1 << vv[j]));
                        dp[key] = true;
                        ans = max(ans, __builtin_popcount(key));
                    }
                }
            }
        }

        print(ans);
    }

	return 0;
}


Measured memory_bytes: 7284