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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Set;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author whhone
 */
public class Main {
  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    InputReader in = new InputReader(inputStream);
    OutputWriter out = new OutputWriter(outputStream);
    TaskB solver = new TaskB();
    solver.solve(1, in, out);
    out.close();
  }

  static class TaskB {
    public void solve(int testNumber, InputReader in, OutputWriter out) {
      int n = in.nextInt();
      int[][] a = new int[n][n];
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          a[i][j] = in.nextInt();
        }
      }
      boolean done = false;
      for (int i = 0; i < n; i++) {
        MultiSet<Integer> ms = new MultiSet<Integer>();
        int v = 0;
        for (int j = 0; j < n; j++) {
          ms.add(a[i][j]);
        }
        for (int k : ms.elementSet()) {
          if (k + ms.count(k) == n) {
            v = k;
            if (v == n - 1 && done) v = n;
            if (v == n - 1) done = true;
          }
        }
        out.print(v);
        if (i == n - 1) out.println();
        else out.print(' ');
      }
    }

  }

  static class OutputWriter extends PrintWriter {
    public OutputWriter(OutputStream stream) {
      super(stream);
    }

    public OutputWriter(Writer writer) {
      super(writer);
    }

  }

  static class MultiSet<T> {
    HashMap<T, Integer> hm;

    public MultiSet() {
      hm = new HashMap<T, Integer>();
    }

    public void add(T object) {
      add(object, 1);
    }

    public void add(T object, int occurrences) {
      if (contains(object)) {
        hm.put(object, hm.get(object) + occurrences);
      } else {
        hm.put(object, occurrences);
      }
    }

    public boolean contains(T object) {
      return hm.containsKey(object);
    }

    public Set<T> elementSet() {
      return hm.keySet();
    }

    public int count(T object) {
      return hm.getOrDefault(object, 0);
    }

  }

  static class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
      reader = new BufferedReader(new InputStreamReader(stream), 32768);
      tokenizer = null;
    }

    public String nextLine() {
      try {
        return reader.readLine();
      } catch (IOException e) {
        throw new RuntimeException(e);
      }
    }

    public String next() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        tokenizer = new StringTokenizer(nextLine());
      }
      return tokenizer.nextToken();
    }

    public int nextInt() {
      return Integer.parseInt(next());
    }

  }
}