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 sum(a) a.inject(:+) end

n = inp[0]
a = inp
b = inp

a_sort = a.sort
b_sort = b.sort
c = 0
n.times do |i|
  if(a_sort[i] > b_sort[i])
    puts "No"
    exit
  end
end
a_min_ind = a.index(a.min)
b_max_ind = a.index(a.min)
f = false
  if(a_sort[0] >= b[-2] and b_max_ind != a_min_ind)
    f = true
  end
puts (f)? "No" : "Yes"
