All-Berland programming contest comes to an end. In total, n teams participated in it. Like in ACM-ICPC, current results stopped refreshing one hour before the contest ends. So at the Award Ceremony, results are partially known. For each team the value a i is given — the number of points the i -th team has earned before the last hour of the contest. Besides that, the Jury has evaluated all submissions sent during the last hour and knows values d i — the number of points earned by the i -th team during the last hour (these values can be negative, which means that a team can lose points). Before the contest, each team got unique id from 1 to n . According to the contest rules, a team with more points takes a higher place. If two or more teams have equal number of points, the team with lower id will take the higher place. So no two teams can share the same place. The Award Ceremony proceeds in the following way. At the beginning of the ceremony, a large screen shows the results for the time moment "one hour before the end", which means that the i -th team has a i points. Then the Jury unfreezes results of the teams one by one in some order. When result of the j -th team is unfrozen, its score changes from a j to a j + d j . At this time the table of results is modified and the place of the team can change. The unfreezing of the j -th team is followed by the applause from the audience with duration of | x j - y j | seconds, where x j is the place of the j -th team before unfreezing and y j is the place right after the unfreezing. For example, if the team does not change the place, there is no applause from the audience. As you can see, during the Award Ceremony, each team will be unfrozen exactly once. Your task is to find such an order to unfreeze all the teams that the total duration of applause is maximum possible. The first line of the input file contains a single integer n ( 1 ≤ n ≤ 100 ) — the number of teams. Each of the next n lines contains two intege