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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using static System.Console;
using static System.Math;
using System.IO;
using System.Collections.Generic;
namespace I_am_the_green_coder{
    class Inonoa{
        static void Main(){
            long n = ILongs()[0];
            long[][] a = ILongLongs(n);
            List<long[]>[,] b = new List<long[]>[n+1,n+1];

            for(int i=0;i<n+1;i++){
                for(int j=0;j<n+1;j++){
                    b[i,j] = new List<long[]>();
                }
            }
            for(int i=0;i<n;i++){
                for(int j=0;j<n-1;j++){
                    b[i+1,a[i][j]].Add(new long[2]{i,a[i][j]-1});
                    //b[a[i][j],i+1].Add(new long[2]{i,a[i][j]-1});
                }
            }

            int[] row = new int[n];
            for(int i=0;i<n;i++){
                row[i] = 0;
            }

            long ans = 0;
            HashSet<long> yatteru = new HashSet<long>();

            while(true){
                bool hueta = false;
                bool owata = true;
                for(int i=0;i<n;i++){
                    if(row[i]<n-1){
                        owata = false;
                        long[] match = new long[2]{a[i][row[i]],i+1};
                        foreach(long[] mc in b[match[0],match[1]]){
                            if(Math.Max(mc[0],mc[1])==Max(i,row[i]) && Min(mc[0],mc[1])==Min(i,row[i])){continue;}
                            else{
                                if(row[mc[0]]==mc[1] && (!yatteru.Contains(match[0])) && (!yatteru.Contains(match[1]))){
                                    row[(b[match[0],match[1]][0])[0]]++;
                                    row[(b[match[0],match[1]][0])[1]]++;
                                    hueta = true;
                                    yatteru.Add(match[0]);
                                    yatteru.Add(match[1]);
                                    break;
                                }else{
                                    break;
                                }
                            }
                        }
                    }
                }
                if(!hueta){
                    if(owata)break;
                    Console.WriteLine(-1);
                    return;
                }
                ans ++;
                yatteru = new HashSet<long>();
            }
            WriteLine(ans);
        }

        static readonly long MOD = 1000000007;

        ///<summary>a_1, a_2, a_3, ...みたいなの</summary>
        static long[] ILongs(){
            string[] s = ReadLine().Split();
            long[] re = new long[s.Length];
            for(long i=0;i<s.Length;i++){
                re[i] = long.Parse(s[i]);
            }
            return re;
        }

        ///<summary>xooxoxoxxoxo...みたいなの</summary>
        static char[] IChars(){
            return ReadLine().ToCharArray();
        }

        ///<summary>n m とかをちょっとはやくかくだけ</summary>
        static string[] IStrings(){
            return ReadLine().Split();
        }

        ///<summary>n行の入力を取ったり</summary>
        static long[][] ILongLongs(long n){
            long[][] re = new long[n][];
            for(long i=0;i<n;i++){
                string[] s = ReadLine().Split();
                re[i] = new long[s.Length];
                for(long j=0;j<s.Length;j++){
                    re[i][j] = long.Parse(s[j]);
                }
            }
            return re;
        }

        ///<summary>n行の文字列を取ったり</summary>
        static char[][] ICharsChars(long n){
            char[][] re = new char[n][];
            for(long i=0;i<n;i++){
                re[i] = ReadLine().ToCharArray();
            }
            return re;
        }
    }
}