Mine Field
"Two things are infinite: The universe and human stupidity;and I'm not sure about the universe."
Albert Einstein
This is World War II. The news from enemy's camp is so disappointing and we lost 4 of our spies. The fifth, Hyperion, have been arrested and have been tortured to tell the name of the others. So we have to do something to make them angry and distracting them.
In the last news of our last spy we have found out that there is some mine fields in the enemy's camp. Our Spy has found out the coordinate of mines. Each mine has a restricted range. If anything moves in this range or another mine explodes in this range, all of the things in this range will be explodes and become as same as soil. We want to make the enemy angry so we want to fire a missile in this field and destroy some mines. You have to tell us the largest number of mines that we can destroy if we are lucky.
Input
Input consists of several test cases. Each test case starts with an integer N the number of mines. Then N line follows. Each line contains 3 integers. First 2 integers are X and Y the coordinates of each mine and the third integer is R the range of that mine. Two consecutive inputs separate with a black line. Input terminates with end of file. (N ≤ 1000, -100 ≤ X, Y ≤ 100, R < 10).
Output
For each test case you should print one line explaining the maximum number of mines that can be destroyed.