Submit solution

Points: 1
Time limit: 2.0s
Memory limit: 256M

Problem type
Allowed languages
C, C++, Haskell, Java, Python

Farmer John's \(N\) cows (\(1\leq N \leq 200\)) want to organize an emergency "moo-cast" system for broadcasting important messages among themselves.

Instead of mooing at each-other over long distances, the cows decide to equip themselves with walkie-talkies, one for each cow. These walkie-talkies each have a limited transmission radius -- a walkie-talkie of power \(P\) can only transmit to other cows up to a distance of \(P\) away (note that cow A might be able to transmit to cow B even if cow B cannot transmit back, due to cow A's power being larger than that of cow B). Fortunately, cows can relay messages to one-another along a path consisting of several hops, so it is not necessary for every cow to be able to transmit directly to every other cow.

Due to the asymmetrical nature of the walkie-talkie transmission, broadcasts from some cows may be more effective than from other cows in their ability to reach large numbers of recipients (taking relaying into account). Please help the cows determine the maximum number of cows that can be reached by a broadcast originating from a single cow.


The first line of input contains \(N\). The next \(N\) lines each contain the x and y coordinates of a single cow (integers in the range \([0,25000]\)) followed by \(p\),the power of the walkie-talkie held by this cow.


Write a single line of output containing the maximum number of cows a broadcast from a single cow can reach. The originating cow is included in this number.

Sample Inout

1 3 5
5 4 3
7 2 1
6 1 1

Sample Output



There are no comments at the moment.