Problem: 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}.

Solution (in JAVA):

Solution:
import java.awt.*;
import java.awt.geom.Line2D;
import java.io.*;
import java.math.*;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.nio.file.attribute.BasicFileAttributeView;
import java.nio.file.attribute.FileTime;
import java.text.ParseException;
import java.text.SimpleDateFormat;
import java.util.*;
import java.util.List;
import java.util.concurrent.TimeUnit;
 
import javax.sound.sampled.Line;
 
 
public class Main implements Runnable {
     
    int maxn = (int)3e2+111;
    int mod = (int)1e9+7;
    int inf = (int)1e9;
    int n,m,k;
    int a[][] = new int[maxn][maxn];
    boolean used[] = new boolean[maxn];
    
    void solve() throws Exception {
    	
    	n = in.nextInt();
    	for (int i=1; i<=n; i++) {
    		for (int j=1; j<=n; j++) {
    			a[i][j] = in.nextInt();
    		}
    	}
    	
    	int ans[] = new int[n+1];
    	for (int i=1; i<=n; i++) {
    		ans[i]=n;
    	}
    	
    	for (int k=1; k<n; k++) {
    		for (int i=1; i<=n; i++) {
    			HashSet<Integer> set = new HashSet<Integer>();
    			int num = 0;
    			boolean ok = true;
    			if (used[i]) continue;
    			for (int j=1; j<=n; j++) {
    				if (used[j] || a[i][j]==0) continue;
    				num = a[i][j];
    				set.add(num);
    				if (set.size()>1) {
    					ok = false;
    					break;
    				}
    			}
    			
    			if (ok) {
    				used[i] = true;
    				ans[i] = num;
    				break;
    			}
    		}
    	}
    	
    	for (int i=1; i<=n; i++) {
    		out.print(ans[i] + " ");
    	}
    
    }    
    
	class Pair implements Comparable<Pair>{
        int x,y; 
        public Pair (int x, int y) {
            this.x = x;
            this.y = y;
        }
 
        @Override
        public int compareTo(Pair p) {
            if (x>p.x) return 1;
            else if (x==p.x) {
                if (y>p.y) return 1;
                else if (y==p.y) return 0;
                else return -1;
            } else {
                return -1;
            }
         
        }
    }
     
    String fileInName = "network";
    boolean file = false;
    boolean isAcmp = true;
     
    static Throwable throwable;
    public static void main (String [] args) throws Throwable {
    	Locale.setDefault(new Locale("en", "US"));
        Thread thread = new Thread(null, new Main(), "", (1 << 26));
        thread.start();
        thread.join();
        thread.run();
        if (throwable != null)
            throw throwable;
    }
     
    FastReader in;
    PrintWriter out;
 
    public void run() {
        String fileIn = "input.txt";
        String fileOut = "output.txt";
         
        try {
            if (isAcmp) {
                if (file) {
                    in = new FastReader(new BufferedReader(new FileReader(fileIn)));
                    out = new PrintWriter (fileOut);
                } else {
                    in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
                    out = new PrintWriter(System.out);
                }
            } else if (file) {
                in = new FastReader(new BufferedReader(new FileReader(fileInName+".in")));
                out = new PrintWriter (fileInName + ".out");
            } else {
                in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
                out = new PrintWriter(System.out);
            }
             
            solve();
        } catch(Exception e) {
            throwable = e;
        } finally {
            out.close();
        }
 
    }
}
 
class FastReader {
    BufferedReader bf;
    StringTokenizer tk = null;
 
    public FastReader(BufferedReader bf) {
        this.bf = bf;
    }
     
    public String nextToken () throws Exception {
        if (tk==null || !tk.hasMoreTokens()) {
            tk = new StringTokenizer(bf.readLine());
        }
        if (!tk.hasMoreTokens()) return nextToken();
        else
            return tk.nextToken();
    }
     
    public int nextInt() throws Exception {
        return Integer.parseInt(nextToken());
    }
     
    public long nextLong() throws Exception {
        return Long.parseLong(nextToken());
    }
     
    public double nextDouble() throws Exception {
        return Double.parseDouble(nextToken());
    }
}