Problem:
Score : 500 points

Problem Statement

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.

Sample Input 1

3
2 3
1 3
1 2

Sample Output 1

3

All the conditions can be satisfied if the matches are scheduled for three days as follows:

Day 1: Player 1 vs Player 2

Day 2: Player 1 vs Player 3

Day 3: Player 2 vs Player 3

This is the minimum number of days required.

Sample Input 2

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

Sample Output 2

4

All the conditions can be satisfied if the matches are scheduled for four days as follows:

Day 1: Player 1 vs Player 2, Player 3 vs Player 4

Day 2: Player 1 vs Player 3

Day 3: Player 1 vs Player 4, Player 2 vs Player 3

Day 4: Player 2 vs Player 4

This is the minimum number of days required.

Sample Input 3

3
2 3
3 1
1 2

Sample Output 3

-1

Any scheduling of the matches violates some condition.

Solution in Rust (1.15.1) (judge verdict: Runtime Error)

use std::io::*;
use std::str::FromStr;

pub fn read<T: FromStr>() -> T {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok().expect("failed to parse token")
}

pub fn read_n<T: FromStr>(n: usize) -> Vec<T> {
    read_n_logic::<T>(n, vec![])
}

pub fn read_n_logic<T: FromStr>(n: usize, mut a: Vec<T>) -> Vec<T> {
    match n {
        0 => a,
        _ => {
            a.push(read::<T>());
            read_n_logic(n - 1, a)
        }
    }
}
use std::cmp::{max, min};

fn main() {
    let n: usize = read();
    let mut tree: Vec<Vec<Vec<(usize, usize)>>> = vec![vec![vec![]; n + 1]; n + 1];
    for i in 0..n {
        let ii = i + 1;
        let mut cn: (usize, usize) = (0, 0);
        for _ in 0..n - 1 {
            let j: usize = read();
            let a = max(ii, j);
            let b = min(ii, j);
            if cn.0 == 0 && cn.1 == 0 {
                cn = (a, b);
                continue;
            }
            tree[cn.0][cn.1].push((a, b));
            cn = (a, b);
        }
    }

    let mut memo: Vec<Vec<usize>> = vec![vec![0; n + 1]; n + 1];
    let mut maxv = 0;
    for i in 1..n + 1 {
        for j in 1..n {
            let mut cv: usize = 1;
            let a = max(i, j);
            let b = min(i, j);
            if memo[i][j] != 0 {
                cv += memo[a][b];
                maxv = max(maxv, cv);
                continue;
            }
            let m = search((a, b), &tree, &mut cv);
            maxv = max(maxv, m);
        }
    }

    println!("{}", maxv);
}

fn search(cn: (usize, usize), tree: &Vec<Vec<Vec<(usize, usize)>>>, cv: &mut usize) -> usize {
    if tree[cn.0][cn.1].len() == 0 {
        return *cv;
    }

    let mut maxv = cv.clone();
    *cv += 1;
    for i in &tree[cn.0][cn.1] {
        let mut maxvc = cv.clone();
        maxv = max(maxv, search((i.0, i.1), tree, &mut maxvc));
    }
    return maxv;
}