Consider several locations in integer points on the plane. One of the locations is the base where workers wait. Every other location contains one job. Each job has the following characteristics: work duration, the required number of workers, and also the earliest possible moment of starting the job and the latest possible moment of completing it. In order to complete the job, the required number of workers must simultaneously start working on it, and then be continuously present at the location for the duration of the job. Each job must either be fully done exactly once, or left untouched. Our task is to determine what should the workers do so that we have more profit. any worker can contribute to any job. We can use as many workers as we like, but each worker must take part in doing at least one job. Each worker starts at the base at a certain moment, then moves between locations and does the jobs, and finally gets back to the base and stops completely. A worker can move along coordinate axes, and spends one minute increasing or decreasing any one of his coordinates by (1). We have to pay the worker (240) credits for appearing in our solution, and additionally (1) credit per minute, up to the moment when the worker stops completely. We get rewarded for each job that is done. For a job with duration (d) and the required number of workers (p), we get a reward of (d \cdot p \cdot (p + 5)) credits. The jobs which are not done don't contribute to this sum. Input The first line contains an integer (n) from (500) to (2000): the number of locations. Each of the following (n) lines contains six integers and describes one location in the format (x) (y) (d) (p) (l) (h) . The coordinates (x) and (y) are integers from (0) to (100). The duration (d) is an integer from (5) to (30) minutes. The required number of workers (p) is an integer from (1) to (7) people. The ea