Bob has a permutation of integers from 1 to n. Denote this permutation as p. The i-th element of p will be denoted as pi. For all pairs of distinct integers i, j between 1 and n, he wrote the number ai, j = min(pi, pj). He writes ai, i = 0 for all integer i from 1 to n.

Bob gave you all the values of ai, j that he wrote down. Your job is to reconstruct any permutation that could have generated these values. The input will be formed so that it is guaranteed that there is at least one solution that is consistent with the information given.

Input

The first line of the input will contain a single integer n (2 ≤ n ≤ 50).

The next n lines will contain the values of ai, j. The j-th number on the i-th line will represent ai, j. The i-th number on the i-th line will be 0. It's guaranteed that ai, j = aj, i and there is at least one solution consistent with the information given.

Output

Print n space separated integers, which represents a permutation that could have generated these values. If there are multiple possible solutions, print any of them.

Examples

Input

2
0 1
1 0


Output

2 1


Input

5
0 2 2 1 2
2 0 4 1 3
2 4 0 1 3
1 1 1 0 1
2 3 3 1 0


Output

2 5 4 1 3

Note

In the first case, the answer can be {1, 2} or {2, 1}.

In the second case, another possible answer is {2, 4, 5, 1, 3}.




import java.util.*;
import java.lang.*;
import java.lang.reflect.Array;
import java.io.*;
//import javafx.util.Pair;
import java.util.HashMap;
import java.io.BufferedReader; 
import java.io.FileReader; 
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.Scanner; 
import java.util.StringTokenizer; 
import java.io.DataInputStream; 
import java.io.FileInputStream; 
import java.math.BigInteger;
import java.math.BigDecimal;
import java.text.DecimalFormat;
import java.util.BitSet;
 public class Prac{
    
    
    static class InputReader {
 
		private final InputStream stream;
		private final byte[] buf = new byte[8192];
		private int curChar, snumChars;
 
		public InputReader(InputStream st) {
			this.stream = st;
		}
 
		public int read() {
			if (snumChars == -1)
	 			throw new InputMismatchException();
			if (curChar >= snumChars) {
				curChar = 0;
				try {
					snumChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (snumChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
 
		public int ni() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public long nl() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
 
		public int[] nia(int n) {
			int a[] = new int[n];
			for (int i = 0; i < n; i++) {
				a[i] = ni();
			}
			return a;
		}
 
		public String rs() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}
 
		public String nextLine() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndOfLine(c));
			return res.toString();
		}
 
		public boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
 
		private boolean isEndOfLine(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}
 
	}
    

     static PrintWriter w = new PrintWriter(System.out);
    public static void main(String[] args) throws IOException {   
        InputReader sc=new InputReader(System.in);
        //DecimalFormat df=new DecimalFormat("0.00000000000000000000");
        //BigInteger b,max=BigInteger.ZERO;
        //Scanner sc=new Scanner(System.in);
       // HashMultiSet<Integer> multiSet = new HashMultiSet<>(new HashMap<>());      
       //findFact();
       int n=sc.ni();
       int i=0,j=0;
       int mat[][]=new int[n+1][n+1];
       for(i=1;i<=n;i++){
           for(j=1;j<=n;j++)
               mat[i][j]=sc.ni();
       }
       int min[][]=new int[n+1][2];
       
       for(i=1;i<=n;i++){
           int same[]=new int[n+1];
           for(j=1;j<=n;j++){
               
               if(mat[i][j]==0)
                   continue;
               else
                   same[mat[i][j]]++;
                           
               
           }
            int max=0,index=0;
            for(j=1;j<=n;j++){
                if(same[j]>max){
                    max=same[j];
                    index=j;
                }
            }
            min[i][0]=index;
            min[i][1]=max;
       }
       int ans[]=new int[n+1];
        j=n;
       for(i=1;i<=n;i++){
          
           if(min[i][1]>1)
               ans[i]=min[i][0];
           else {
               ans[i]=j;
               j--;
           }
       }
       for(i=1;i<=n;i++)
           w.print(ans[i]+" ");
       w.println();
       w.close();
    }  
    
}
