#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};

const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};


ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
ll pow_mod(ll x, ll k){
  x %= MOD; x += MOD; x %= MOD;
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

/*
//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
*/

const ll MAX_V = 1000010;
ll V;//頂点数
vector<ll> E[MAX_V];
vector<ll> in(MAX_V);

vector<ll> Tsort(){
  ll num = 1;//連結だと仮定してのトポロジカルソートの数
  ll longest_path = 0;
  vector<ll> res;
  rep(i, V)for(ll to : E[i]) in[to]++;
  set<ll> now, next;
  rep(i, V)if(in[i] == 0) now.insert(i);
  while(now.size()){
    longest_path++;
    num *= now.size();
    num %= MOD;
    for(auto itr = now.begin(); itr != now.end(); itr++){
      res.pb(*itr);
      for(ll to : E[*itr]){
        in[to]--;
        if(in[to] == 0) next.insert(to);
      }
    }
    now = next;
    next.clear();
  }
  bool l = 1;
  rep(i, V) if(in[i] != 0) longest_path = -1;
  cout << longest_path << endl;
  return res;
}

int main(){
  ll N;
  cin >> N;
  rep(i, N){
    ll a;
    cin >> a;
    a--;
    rep(j, N-2){
      ll b;
      cin >> b;
      b--;
      E[min(i, a) * N + max(i, a)].pb(min(i, b) * N + max(i, b));
      a = b;
    }
  }
  rep(i, N*N){
    if(E[i].size() >= 2){
      sort(E[i].begin(), E[i].end());
      E[i].erase(unique(E[i].begin(), E[i].end()), E[i].end());
    }
  }

  V = N * N;
  Tsort();
}


Measured memory_bytes: 75128