#exec({'RUBY_THREAD_VM_STACK_SIZE'=>'100000000'},'/usr/bin/ruby', $0) if !ENV['RUBY_THREAD_VM_STACK_SIZE']

def inpf() a=gets.chomp.split(" ").map(&:to_f)end

def inps() a=gets.chomp.split(" ")end

def copy(a) Marshal.load(Marshal.dump(a)) end

def kaijo(n,r = 10**9+7)(n < 2)? 1 : (2..n).inject{|memo,u|memo=(memo*u)%r} end

def na(n,d=0) Array.new(n,d)end

def na2(n,m,d=0) Array.new(n){Array.new(m,d)}end

def na3(n,m,l,d=0) Array.new(n){Array.new(m){Array.new(l,d)}}end

def inp() a=gets.chomp.split(" ").map(&:to_i)end

def r_up(a, b) (a+b-1)/b end

def r_sort(a) a.sort{|a,b|b<=>a} end

def search(x,d)
  return 1 if(d >= @size)
  if(@memo[x][d] === false)
    p -1
    exit
  end
  return @memo[x][d] if(@memo[x][d] != nil)
  @memo[x][d] = false
  nx = @t[x][d]-1
  nd = @mem[nx][x]+1
  hyo = [search(nx,nd),search(x,d+1)].max + 1
  @memo[x][d] = hyo
  return hyo
end

n = inp[0]
@size = n-1
@t= []
@memo = na2(n,n-1,nil)
@mem = na2(n,n,nil)
n.times do
  @t.push(inp)
end
n.times do |i|
  (n-1).times do|j|
    @mem[i][@t[i][j]-1] = j
  end
end

ans = 0
n.times do |i|
  ans = [ans,search(i,0)].max
end

p ans-1
