/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author champon
 */

#include <iostream>
#include <fstream>
//<editor-fold desc="definitions">
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
#define enl "\n"
using namespace std;
using ll=long long;
using ld=long double;
using vi = vector<int>;
using vii = vector<vector<int>>;
using viii = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vll = vector<vector<ll>>;
using vlll = vector<vector<vector<ll>>>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
ll mod = ll(1e9)+7;
ll inf = ll(1e18);
void bl(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void bl2(bool b, ostream& out=cout){ out << (b ? "YES" : "NO") << endl; }
template<typename T> inline bool chmax(T &a, T b){ if(a<b){a=b; return true;} return false; }
template<typename T> inline bool chmin(T &a, T b){ if(a>b){a=b; return true;} return false; }
int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};

#ifndef INCLUDE_DEBUG_HPP
#define INCLUDE_DEBUG_HPP

#define TO_STRING(varName) # varName
#include <iostream>
#include <vector>
#include <map>
using namespace std;

namespace dbg {
    using ll = long long;

    class Debug {
        void prefix(string s){
            cout << "\033[7m\033[35m" << " DEBUG " << "\033[0m\033[35m"
            << " " << s << "\033[0m" << endl;
        }
    public:
        Debug(){}
        // vector d1
        template<typename T>
        void print(vector<T> &vec);

        // vector tuple
        template<typename T1, typename T2>
        void print(vector<pair<T1, T2>>& vec, int idx = 0);

        // vector d2
        template<typename T>
        void print(vector<vector<T>>& vec);

        // vector d2
        template<typename T>
        void print(vector<vector<vector<T>>>& vec);

        // vector array d1
        template<typename T>
        void print(T *arr, ll n);

        // vector array d2
        template<typename T>
        void print(T *arr, int n, int m);

        // set
        template<typename T>
        void print(set<T>& st);

        // vector map or set
        template<typename T>
        void print(T cont);
    };

    template<typename T>
    void Debug::print(vector<T>& vec) {
        prefix("vector");
        for (auto& v : vec) cout << v << " ";
        cout << endl;
    }

    template<typename T1, typename T2>
    void Debug::print(vector<pair<T1, T2>>& vec, int idx) {
        prefix("vector pair");
        for (auto& v : vec) cout << (!idx ? get<0>(v) : get<1>(v)) << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::print(vector<vector<T>>& vec) {
        prefix("vector d2");
        for (auto& vv : vec) {
            for (auto& v : vv) cout << v << " ";
            cout << endl;
        }
    }

    template<typename T>
    void Debug::print(vector<vector<vector<T>>>& vec) {
        prefix("vector d3");
        for(auto& vvv : vec) {
            cout << "[";
            for(int i=0; i<vvv.size(); i++) {
                if(i) cout << " ";
                for(int j=0; j<vvv[i].size(); j++) {
                    if(j) cout << " ";
                    cout << vvv[i][j];
                }
                if(i != vvv.size()-1) cout << endl;
            }
            cout << "]" << endl;
        }
    }

    template<typename T>
    void Debug::print(T *arr, ll n) {
        prefix("array");
        for (int i = 0; i < n; i++) cout << arr[i] << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::print(T *arr, int n, int m) {
        prefix("array d2");
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << arr[i][j] << " ";
            }
            cout << endl;
        }
    }

    template<typename T>
    void Debug::print(set<T>& st) {
        prefix("set");
        for(auto& e : st) cout << e << " ";
        cout << endl;
    }

    template<typename T>
    void Debug::print(T cont) {
        prefix("key value");
        for (auto& e : cont)
            cout << e.first << " : " << e.second << endl;
        cout << endl;
    }

}

#endif //INCLUDE_DEBUG_HPP

dbg::Debug debug;
//</editor-fold>

class ELeague {
public:
    vii a;

	void solve(std::istream& in, std::ostream& out) {
	    int n;
	    in >> n;
	    a = vii(n, vi(n-1));
	    for(int i=0; i<n; i++){
	        for(int j=0; j<n-1; j++){
	            in >> a[i][j];
	            --a[i][j];
	        }
	    }

        vi cur(n);
	    int cnt = 0, day = 0;
	    bool judge = true;
	    using pipi = pair<int, pair<int, int>>;
	    set<pipi> st;
	    for(int i=0; i<n; i++) {
            int mi = min(i, a[i][0]);
            int mx = max(i, a[i][0]);
            if(st.count(make_pair(1, make_pair(mi, mx)))){
                st.erase(make_pair(1, make_pair(mi, mx)));
                pipi pp = make_pair(2, make_pair(mi, mx));
                st.insert(pp);
            }else{
                pipi pp = make_pair(1, make_pair(mi, mx));
                st.insert(pp);
            }
	    }

	    while(cnt < n*(n-1)/2) {
            if((--st.end())->first < 2){
                judge = false;
                break;
            }

            vector<pair<int, int>> buf;
            while(!st.empty() && (--st.end())->first >= 2){
                auto p = --st.end();
                cnt++;
                int p1 = p->second.first;
                int p2 = p->second.second;
                cur[p1]++; cur[p2]++;
                st.erase(p);

                int mi1 = min(p1, a[p1][cur[p1]]);
                int mx1 = max(p1, a[p1][cur[p1]]);
                int mi2 = min(p2, a[p2][cur[p2]]);
                int mx2 = max(p2, a[p2][cur[p2]]);

                buf.emplace_back(mi1, mx1);
                buf.emplace_back(mi2, mx2);
            }
            for(auto& p : buf){
                int mi = p.first;
                int mx = p.second;
                if(st.count(make_pair(1, make_pair(mi, mx)))){
                    st.erase(make_pair(1, make_pair(mi, mx)));
                    pipi pp = make_pair(2, make_pair(mi, mx));
                    st.insert(pp);
                }else{
                    pipi pp = make_pair(1, make_pair(mi, mx));
                    st.insert(pp);
                }
            }

            day++;
	    }

	    if(!judge) out << -1 << enl;
	    else out << day << enl;
	}
};


int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
	ELeague solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}


Measured memory_bytes: 7580