National Olympiad in Informatics, China, 1997

A city organized an all-around high school science Olympiad where $N$ competitors (with ID's from 1 to $N$) each participate in 8 competitions in the subjects of mathematics, physics, chemistry, astronomy, geography, biology, informatics, and linguistics. In the end, scores are taken from all of these fields to produce an overall ranking of the competitors.

Let $x_{i,j}$ denote the rank of competitor $i$ in the $j$-th competition $(1\le i\le N,1\le j\le 8)$.

• The average score of the $j$-th competition is $av{g}_j=\frac{1}{N}\sum _{i=1}^N{x}_{i,j}$, $(1\le j\le 8)$.
• The overall score of competitor $i$ is $sum{x}_i=\sum _{j=1}^8{x}_{i,j}$, $(1\le i\le N)$.
• The rank of competitor $i$ in the $j$-th competition is: $${\displaystyle y_{i,j}=\{\begin{array}{ll}0& (\sum _{i=1}^N|x_{i,j}-av{g}_j|=0)\\ \frac{x_{i,j}-av{g}_j}{\frac{1}{N}\sum _{i=1}^N|x_{i,j}-av{g}_j|}& (\sum _{i=1}^N|x_{i,j}-av{g}_j|\ne 0)\end{array}}$$
• The overall position score for competitor $i$ is $sum{y}_i=\sum _{k=1}^3{y}_{i,k}+0.8\sum _{k=4}^8{y}_{i,k}$, $(1\le i\le N)$.

The rules for ranking are as follows:

1. Competitors with higher overall position scores are ranked higher.
2. If two or more competitors have the same overall position score, then the competitor(s) with a higher overall score is ranked higher.
3. If two or more competitors have the same overall position score and the overall score, then the competitor(s) with the smaller ID is ranked higher.

Please write a program for the organizers to compute the rankings of competitors.

Input Specification

The first line of input contains the integer $N$ $(1\le N\le 1000)$. The following $N$ lines will each contain 8 space-separated integers $x_{i,1},x_{i,2},\dots ,x_{i,8}$, each between 0 and 100, representing the scores of each competitor in the 8 competitions.

Output Specification

The output should contain $N$ lines, where line $i$ contains the ID of the competitor with rank $i$ (for $1\le i\le N$).

Sample Input

3
72 82 73 68 95 86 82 90
72 90 50 60 80 70 65 80
72 82 73 68 95 86 82 90

Sample Output

1
3
2

Problem translated to English by Alex.