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.util.*;


import java.io.*;

public class Main {
	private static void solve(){
		//Implement solution here.
		int n = ni();
		ArrayDeque<Integer>[] qa = new ArrayDeque[n];
		for(int i = 0; i < n; i++) {
			qa[i] = new ArrayDeque<Integer>(n);
			for(int j = 0; j < n - 1; j++) {
				qa[i].add(ni());
			}
		}

		int result = 0;
		boolean[] checked = new boolean[n];
		boolean[] matchedBefore = new boolean[n];
		Arrays.fill(matchedBefore, true);
		
		while(true) {
			//Completion check
			boolean isComp = true;
			for(int i = 0; i < n; i++) {
				isComp = isComp && qa[i].isEmpty();
			}
			if(isComp)break;
			
			//Find match
			boolean matchable = false;			
			for(int i = 0; i < n; i++) {
				if(!matchedBefore[i])continue;
				if(qa[i].isEmpty() || checked[i])continue;
				int target = qa[i].peek();
				if(!checked[target - 1] && qa[target - 1].peek() == i + 1) {
					qa[i].poll();
					qa[target - 1].poll();
					checked[i] = true;
					checked[target - 1] = true;
					matchable = true;
					matchedBefore[i] = true;
					matchedBefore[target - 1] = true;
				} else {
					matchedBefore[i] = false;
				}
			}
			
			//Continue check
			if(!matchable) {
				result = -1;
				break;
			} else {
				result++;
				Arrays.fill(checked, false);
			}			
		}
		System.out.println(result);
	}

	//Switch input source (stdin/file)
	private static BufferedReader br  = new BufferedReader(new InputStreamReader(System.in));
	public static void main(String[] args){
		String debugDataPath = System.getenv("DD_PATH");        
		if(debugDataPath != null){
			try{
				br = new BufferedReader(new InputStreamReader(new FileInputStream(new File(debugDataPath))));
			}catch(Exception e){
				throw new RuntimeException(e);
			}
		} 
		solve();
	}

	//Input read utility
	private static StringTokenizer tokenizer = null;
	public static String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(br.readLine());
			} catch (Exception e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}
	//Get next single int
	private static int ni() {
		return Integer.parseInt(next());
	}
	//Get next single long
	private static long nl() {
		return Long.parseLong(next());
	}
	//Get next single double
	private static double nd() {
		return Double.parseDouble(next());
	}
	//Get next int array from one line
	private static int[] na(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)
			a[i] = ni();
		return a;
	}
	//Get next char array from one line
	private static char[] ns() {
		return next().toCharArray();
	}
	//Get next long array from one line
	private static long[] nal(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)
			a[i] = nl();
		return a;
	}
}