Immortal Jewels Aizu - 2201

先占个坑，调不过去是真恶心…
ps:

#include <bits/stdc++.h>
#define In inline
#define pi (atan(1.0)*4)
#define enter puts("")
#define MaxN 0x3f3f3f3f
#define MinN 0xc0c0c0c0
#define pb push_back
#define bug(x) cerr<<#x<<'='<<x<<' '
#define ALL(a) a.begin(), a.end()
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define mset(a,b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define eps 1e-6
#define buff ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
template<typename T>
T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>
T lcm(T a,T b){return a*b/gcd(a,b);}
typedef long long ll;
typedef pair<int,int> PII;
const int mod = 998244353;
const int MOD = 1e9+7;
In ll read()
{
	ll ans = 0;
	char ch = getchar(), las = ' ';
	while(!isdigit(ch)) las = ch, ch = getchar();
	while(isdigit(ch)) ans = (ans << 1) + (ans << 3) + ch - '0', ch = getchar();
	if(las == '-')	ans = -ans;
	return ans;
}
In void write(ll x)
{
	if(x < 0) x = -x, putchar('-');
	if(x >= 10)	write(x / 10);
	putchar(x%10 + '0');
}
int sgn(double x){
	if(fabs(x) < eps) return 0;
	return x < 0 ? -1 : 1;
}

struct Point{
	double x, y;
	Point(){}
	Point(double x, double y):x(x), y(y){}
	void input(){ scanf("%lf%lf", &x, &y);}
	Point operator +(Point b){return Point(x+b.x,y+b.y);}
	Point operator -(Point b){return Point(x-b.x,y-b.y);}
	Point operator *(double k){return Point(x*k,y*k);}
	Point operator /(double k){return Point(x/k,y/k);}
	double operator ^(Point b){return x*b.y-y*b.x;}
	bool operator == (Point b){
		return sgn(x-b.x) == 0 && sgn(y-b.y) == 0;
	}
	double abs(double a){
		return a*a;
	}
	double distance(Point b){
		return sqrt(abs(x-b.x)+abs(y-b.y));
	}
	//`返回直线倾斜角 0<=angle<pi`
    double angle(Point e){
        double k = atan2(e.y-y,e.x-x);
//        if(sgn(k) < 0)k += pi;
//        if(sgn(k-pi) == 0)k -= pi;
        return k;
    }
    double len(){
        return hypot(x,y);//库函数
    }
    Point trunc(double r){
        double l = len();
        if(!sgn(l))return *this;
        r /= l;
        return Point(x*r,y*r);
    }
    //`逆时针旋转90度`
    Point rotleft(){
        return Point(-y,x);
    }
    //`顺时针旋转90度`
    Point rotright(){
        return Point(y,-x);
    }
};
typedef Point Vector;
struct Line{
	Point s, e;
	Line(){}
	Line(Point s, Point e):s(s), e(e){}
	Line(Point p,double angle){
        s = p;
        if(sgn(angle-pi/2) == 0){
            e = (s + Point(0,1));
        }
        else{
            e = (s + Point(1,tan(angle)));
        }
    }
	double length(){return s.distance(e);}
	double distance(Point p){
		return fabs((p-s)^(s-e))/length();
	}
};
vector<Line> v;
typedef pair<Line,Line> PLL;
Point Rp(double ANG, double ang, Point p, double r){
	double a = ANG + ang;
	Vector op = {r*cos(a), r*sin(a)};
	return p + op;
}
struct Circle{
	Point p;
	double r;
	Circle(){}
	Circle(Point p, double r):p(p), r(r){}
	bool operator == (Circle c){
		return sgn(r - c.r ) == 0 && p == c.p;
	}
	PLL outter_line(Circle c){
		PLL res;
		double ANG = p.angle(c.p);
		double ang = acos((r-c.r)/p.distance(c.p));
		res = {{Rp(ANG, ang, p, r), Rp(ANG, ang, c.p, c.r)},{Rp(ANG, -ang, p, r), Rp(ANG, -ang, c.p, c.r)}};
		return res;
	}
	PLL inner_line(Circle c){
		PLL res;
		double ANG = p.angle(c.p);
		double ang = acos((r+c.r)/p.distance(c.p));
		res = {{Rp(ANG, ang, p, r), Rp(ANG, ang+pi, c.p, c.r)},{Rp(ANG, -ang, p, r), Rp(ANG, -ang+pi, c.p, c.r)}};
		return res;
 	}
 	//`两圆的关系`
    //`5 相离`
    //`4 外切`
    //`3 相交`
    //`2 内切`
    //`1 内含`
    //`需要Point的distance`
    int relationcircle(Circle v){
        double d = p.distance(v.p);
        if(sgn(d-r-v.r) > 0)return 5;
        if(sgn(d-r-v.r) == 0)return 4;
        double l = fabs(r-v.r);
        if(sgn(d-r-v.r)<0 && sgn(d-l)>0)return 3;
        if(sgn(d-l)==0)return 2;
        if(sgn(d-l)<0)return 1;
        return 0;// int 需要返回值（除条件外） 
    }
    void pointcrosscircle(Circle v,Point &p1,Point &p2){
        double d = p.distance(v.p);
        double l = (d*d+r*r-v.r*v.r)/(2*d);
        double h = sqrt(r*r-l*l);
        Point tmp = p + (v.p-p).trunc(l);
        p1 = tmp + ((v.p-p).rotleft().trunc(h));
        p2 = tmp + ((v.p-p).rotright().trunc(h));
    }
};
Line get_vert(Point a, Point b, double r){
	double ANG = a.angle(b);
	double ang  = ANG - pi/2;
	return Line{Point{b.x+r*cos(ANG), b.y+r*sin(ANG)}, ang};
}

const int N = 55;
void count(Circle C1, Circle C2){//只管添加直线，可以不合法 
	if(C1.r < C2.r) swap(C1, C2);
	int k = C1.relationcircle(C2);
	if(k == 5){
		PLL ans = C1.outter_line(C2);
		v.pb(ans.first), v.pb(ans.second);
		ans = C1.inner_line(C2);
		v.pb(ans.first), v.pb(ans.second);
	}
	else if(k == 4){
		PLL ans = C1.outter_line(C2);
		v.pb(ans.first), v.pb(ans.second);
		v.pb(get_vert(C2.p, C1.p, C1.r));
	}
	else if(k == 3){
		PLL ans = C1.outter_line(C2);
		v.pb(ans.first), v.pb(ans.second);
		Point p1, p2;
		C1.pointcrosscircle(C2, p1, p2);
		Point p = (p1 + p2)/2;
		v.pb(get_vert(C1.p, p, C1.r-p.distance(C1.p)));
		v.pb(get_vert(C2.p, p, C2.r-p.distance(C2.p)));
	}
	else {
		v.pb(get_vert(C1.p, C2.p, C2.r));
		v.pb(get_vert(C1.p, C2.p, -C2.r));
		v.pb(get_vert(C2.p, C1.p, C1.r));
		v.pb(get_vert(C2.p, C1.p, -C1.r));
	}
}
		
		
void run_case(){
	int n;
	while(~scanf("%d", &n), n){
		v.clear();
		Circle c[N][2];
		rep(i, 1, n){
			Point p;
			double r, m;
			p.input();
			scanf("%lf%lf", &r, &m);
			c[i][0] = {p, r}, c[i][1] = {p, m+r};
		}
		rep(i, 1, n-1) rep(j, i+1, n){
			count(c[i][0], c[j][0]);
			count(c[i][0], c[j][1]);
			count(c[i][1], c[j][0]);
			count(c[i][1], c[j][1]);
		}
		int sZ = v.size(), RES = 1;
//		bug(sZ);
		rep(i, 0, sZ-1){
			int cnt = 0;
			rep(j, 1, n){
				Circle C1 = c[j][0], C2 = c[j][1];
				if(sgn(v[i].distance(C1.p)-C1.r)>=0 && sgn(C2.r-v[i].distance(C2.p)>=0)) cnt ++;
			}
			RES = max(RES, cnt);
		}
		write(RES);
		enter;
	}
}

int main()
{
//	freopen("C:\\Users\\MARX HE\\Desktop\\input.txt","r",stdin);
//	freopen("C:\\Users\\MARX HE\\Desktop\\output.txt","w",stdout);
	int _ = 1;
//    int _ = read();
    while(_ --){
		run_case();
    }
}