// ACM-ICPC国内予選2011 D. そして，いくつになった？

#include <iostream>
#include <cmath>
#include <set>

using namespace std;

int col[24], on[24];
set<int> S;

int search(int cur, int n){
	if(S.count(cur)) return 0;
	S.insert(cur);
	int res = 0;
	for(int i=0;i<n;i++){
		if(!(cur&(1<<i))||(on[i]&cur)) continue;
		for(int j=i+1;j<n;j++){
			if(col[i]!=col[j]||!(cur&(1<<j))||(on[j]&cur)) continue;
			res = max(res, 2+search(cur^(1<<i)^(1<<j), n));
		}
	}
	return res;
}

int main(){
	int n;
	int x[24], y[24], r[24];
	while(cin >> n, n){
		S.clear();
		for(int i=0;i<n;i++){
			cin >> x[i] >> y[i] >> r[i] >> col[i];
			on[i] = 0;
			for(int j=0;j<i;j++){
				if(hypot(x[i]-x[j], y[i]-y[j]) < r[i]+r[j]-1e-8) on[i] |= (1<<j);
			}
		}
		cout << search((1<<n)-1, n) << endl;
	}
}