def add(a, w, d)
  while a <= d.size - 1
    d[a] += w
    a += a & -a
  end
end

def sum(i, d)
  ret = 0
  x = i
  while x > 0
    ret += d[x]
    x -= x & -x
  end
  return ret
end

n = gets.split.map(&:to_i)[0]

time = {}
customer = Array.new(n){[]}
n.times{|i|
  l, r = gets.split.map(&:to_i)
  time[l] = 1
  time[r] = 1
  customer[i] = [l, r]
}
#p customer

st = time.keys.sort
#p st
ti = {}
st.each_with_index{|v, i|
  ti[v] = i+1
}
#p ti

d = Array.new(ti.size+1){0}

n.times{|i|
  add(ti[customer[i][0]], 1, d)
  add(ti[customer[i][1]], -1, d)
}

max = 0
st.size.times{|i|
  s = sum(i+1, d)
  max = s if s > max
}
p max