N players will participate in a tennis tournament. We will call them Player 1, Player 2, \ldots, Player N.

The tournament is round-robin format, and there will be N(N-1)/2 matches in total. Is it possible to schedule these matches so that all of the following conditions are satisfied? If the answer is yes, also find the minimum number of days required.

* Each player plays at most one matches in a day.
* Each player i (1 \leq i \leq N) plays one match against Player A_{i, 1}, A_{i, 2}, \ldots, A_{i, N-1} in this order.

Constraints

* 3 \leq N \leq 1000
* 1 \leq A_{i, j} \leq N
* A_{i, j} \neq i
* A_{i, 1}, A_{i, 2}, \ldots, A_{i, N-1} are all different.

Input

Input is given from Standard Input in the following format:


N
A_{1, 1} A_{1, 2} \ldots A_{1, N-1}
A_{2, 1} A_{2, 2} \ldots A_{2, N-1}
:
A_{N, 1} A_{N, 2} \ldots A_{N, N-1}


Output

If it is possible to schedule all the matches so that all of the conditions are satisfied, print the minimum number of days required; if it is impossible, print `-1`.

Examples

Input

3
2 3
1 3
1 2


Output

3


Input

4
2 3 4
1 3 4
4 1 2
3 1 2


Output

4


Input

3
2 3
3 1
1 2


Output

-1
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Map.Entry;

import java.util.PriorityQueue;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main {
	
	public static class Queue {
		int[] data;
		int cap;
		int bottom, top;
		
		public Queue(int cap) {
			this.data = new int[cap];
			this.cap = cap;
			this.bottom = this.top = 0;
		}
		
		public void push(int d) {
			this.data[this.top] = d;
			this.top = (this.top + 1) % this.cap;
		}
		
		public int pop() {
			final int ret = this.data[this.bottom];
			this.bottom = (this.bottom + 1) % this.cap;
			return ret;
		}
		
		public boolean isEmpty() {
			return this.top == this.bottom;
		}
	}
	
	public static void main(String[] args) throws IOException {	
		try(final Scanner sc = new Scanner(System.in)){
			final int N = sc.nextInt();
			
			final int SIZE = N * N;
			ArrayList<HashSet<Integer>> adj = new ArrayList<HashSet<Integer>>();
			for(int i = 0; i < SIZE; i++) {
				adj.add(new HashSet<Integer>());
			}
			
			boolean[] valid = new boolean[SIZE];
			int[] in_degs = new int[SIZE];
			
			for(int i = 0; i < N; i++) {
				int prev_index = -1;
				
				for(int j = 0; j < N - 1; j++) {
					final int a = sc.nextInt() - 1;
					final int min = Math.min(i, a);
					final int max = Math.max(i, a);
					
					final int index = (min * N) + max;
					valid[index] = true;

					if(prev_index >= 0) {
						adj.get(prev_index).add(index);
						in_degs[index] += 1;
					}
					prev_index = index;
				}
			}
			
			int[] depths = new int[SIZE];
			Arrays.fill(depths, -1);
			
			Queue queue = new Queue(SIZE);
			for(int index = 0; index < SIZE; index++) {
				if(valid[index] && in_degs[index] == 0) { queue.push(index); depths[index] = 0; }
			}
			
			while(!queue.isEmpty()) {
				final int node = queue.pop();
				
				for(final int next_node : adj.get(node)) {
					depths[next_node] = Math.max(depths[next_node], depths[node] + 1);
					in_degs[next_node] -= 1;
					if(in_degs[next_node] == 0) { queue.push(next_node); }
				}
			}
			
			for(int index = 0; index < SIZE; index++) {
				if(valid[index] && depths[index] < 0) { 
					System.out.println(-1);
					return;
				}
			}
			
			System.out.println(Arrays.stream(depths).max().getAsInt() + 1);
		}
	}

	public static class Scanner implements Closeable {
		private BufferedReader br;
		private StringTokenizer tok;

		public Scanner(InputStream is) throws IOException {
			br = new BufferedReader(new InputStreamReader(is));
		}

		private void getLine() throws IOException {
			while(!hasNext()){
				tok = new StringTokenizer(br.readLine());
			}
		}

		private boolean hasNext() {
			return tok != null && tok.hasMoreTokens();
		}

		public String next() throws IOException {
			getLine();
			return tok.nextToken();
		}

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

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) throws IOException {
			final int[] ret = new int[n];
			for(int i = 0; i < n; i++){
				ret[i] = this.nextInt();
			}
			return ret;
		}

		public long[] nextLongArray(int n) throws IOException {
			final long[] ret = new long[n];
			for(int i = 0; i < n; i++){
				ret[i] = this.nextLong();
			}
			return ret;
		}

		public void close() throws IOException {
			br.close();
		}
	}
}