#include <iostream>
#include <stdio.h>
#include <stdlib.h> //rand() 0~RAND_MAX2147483647
#include <math.h>
#include <time.h>   //srand((unsigned int)time(NULL));
#include <unistd.h> //sleep
#include <algorithm>
#include <cmath>
#include <vector>
#include <regex> //正規表現
#include <map>
#include <unordered_map>
#include <set>
#include <cassert> //assart
#include <numeric>
#include <iterator>
#include <list>
#include <tuple>

using namespace std;
#define ll long long int
#define FOR(i,min,max) for(int i=(min);i<(max);i++)
#define FOReq(i,min,max) for(int i=(min);i<=(max);i++)
#define FORREV(i,max,min) for(int i=(max)-1;i>=(min);i--)
#define FORREVeq(i,max,min) for(int i=(max);i>=(min);i--)
const int MOD=1e9+7;
const int MOD2=998244353;
const int not0=1;
const int INF=2000000001;
const ll INFll=2e18;
//const int MAX_V=10000;
const double  Micro=1e-5;

int UnUsedVariable(){
    if(INF || Micro || MOD || INFll || MOD2 || not0){;}
    return 0;
}

#define pf printf
#define sf scanf
#define inarray(array,min,max) FOR(i,min,max){cin>>array[i];}
#define inarrayW(arrayA,arrayB,min,max) FOR(i,min,max){cin>>arrayA[i]>>arrayB[i];}
#define br printf("\n");
#define OutputAndReturn0(x) {cout<<(x)<<endl;return 0;}
#define elif else if

#define issame(a,b,c,d) ((a)==(b) and (b)==(c) and (c)==(d))
#define isdiff3(a,b,c) ((a)!=(b) and (b)!=(c) and (c)!=(a))
#define isdiff4(a,b,c,d) ((a)!=(b) and (b)!=(c) and (c)!=(a) and (d)!=(a) and (d)!=(b) and (d)!=(c))
#define isdiff5(a,b,c,d,e) ((a)!=(b) and (b)!=(c) and (c)!=(a) and (d)!=(a) and (d)!=(b) and (d)!=(c) and (e)!=(a) and (e)!=(b) and (e)!=(c) and (e)!=(d))
#define Func3(f,a,b,c) (f)((f)((a),(b)),(c))
#define Func4(f,a,b,c,d) (f)((f)((f)((a),(b)),(c)),(d))

inline int isEven(int x){return x%2==0;}
inline int isOdd (int x){return x%2==1;}
inline ll  gcd(ll a,ll b){ if(b==0)return a;else return gcd(b,a%b);}//最大公約数 なお一方が0なら答えは他方になるので番兵は０で良い また、負の数もOK -4%3=-1となるため
inline ll  lcm(ll a,ll b){return a*b/gcd(a,b);}//MODやオーバーフローには注意！
//inline ll  ceil(double a){return (ll)a+1;}
//ans = accumulate(A, A+N, 0, [](int a, int b) {return gcd(a,b);});
//auto count = std::count_if(v.begin(), v.end(), [](int x) { return x == 1 || x == 3; } );




//Eと名のつくのはデバッグ用！
int EintN(ll array[],const ll num){
    for(int i=0;i<num;i++){cerr<<array[i]<<" ";}
    br;
    return 0;
}
//int EintNN(const int heighth,const int width,int array[heighth][width]){
//    FOR(i, 0, heighth){
//        FOR(k, 0, width){
//            {cerr<<array[i][k]<<" ";}
//        }
//        br;
//    }
//    br;
//    return 0;
//}
int Eint(string str,const ll num){
    cerr<<str<<" is "<<num<<" now."<<endl;
    return 0;
}












ll probA(){
    ll ans;ans=0;
    string S,T;
    cin>>S>>T;
    FOR(i,0 , 3){
        if(S[i]==T[i])ans++;
    }
    OutputAndReturn0(ans);
    return 0;
}

ll probB(){
    ll ans;ans=0;
    ll A,B;
    cin>>A>>B;
    while(ans*A-(ans-1)<B)ans++;
    OutputAndReturn0(ans);
    return 0;
}



ll probC(){
    int ans;ans=0;
    ll N;cin>>N;
    int H[N];
    inarray(H, 0, N);
    
    int ansT=0;
    int numT=-INF;
    
    FOR(i, 0, N){
        if(numT>=H[i])ansT++;
        else ansT=0;
        
        ans=max(ans, ansT);
    
    
        ans=ans;
        numT=H[i];
    }
    
    OutputAndReturn0(ans);
    return 0;
}

ll probD(){
    ll ans;ans=0;
    ll N;cin>>N;
    
    FOR(j, 1, N)
    {
        ans+=j;
    }
    OutputAndReturn0(ans);
    return 0;
}

ll probE(){
    ll ans;ans=0;
    ll N;cin>>N;
    ll A[N][N-1];
    FOR(i, 0, N){
        FOR(k, 0, N-1){
            ll temp;
            cin>>temp;
            A[i][k]=temp-1;
        }
    }
    
    ll NextOpponentNum[N];
    FOR(i, 0, N){NextOpponentNum[i]=0;}
    
    ll day=0;
    bool gamed[N];
    FOR(i, 0, N){
        gamed[i]=false;
    }
    //準備OK
    //ll progress=1;
    while(1){
        ll progress=0;
        ll i=0;
        
        while(i<N){
            if(gamed[i]==true){i++;continue;}
            if(NextOpponentNum[i]==N-1){i++;continue;}
            ll Op=A[i][NextOpponentNum[i]];
            if(gamed[Op]==true){i++;continue;}
           
            if(i!=A[Op][NextOpponentNum[Op]]){i++;continue;}
            
            //ans=ans;
            gamed[i]=gamed[Op]=true;
            progress++;
            NextOpponentNum[i]++;
            NextOpponentNum[Op]++;
            i++;
        }
        
        if(!progress){/*day=-1;*/goto END;}
        day++;
        FOR(i, 0, N){
            gamed[i]=false;
        }
       
        //ans=ans;
    }
    
END:
    if(*min_element(NextOpponentNum, NextOpponentNum+N)!=N-1)day=-1;
    OutputAndReturn0(day);
    return 0;
}

signed main(){
    probE();
    return 0;
}


Measured memory_bytes: 8064