import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }

int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}

alias Pt = Tuple!(int, "a", int, "b");

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto P = new Pt[N];
      foreach (i; 0 .. N) {
        P[i].a = readInt();
      }
      foreach (i; 0 .. N) {
        P[i].b = readInt();
      }
      P.sort!((p, q) => ([p.b, p.a] < [q.b, q.a]));
      debug {
        writeln("P = ", P);
      }
      
      auto as = new Tuple!(int, int)[N];
      foreach (i; 0 .. N) {
        as[i] = tuple(P[i].a, i);
      }
      as.sort();
      
      bool ans = true;
      foreach (i; 0 .. N) {
        ans = ans && (as[i][0] <= P[i].b);
      }
      
      auto uf = new int[N];
      uf[] = -1;
      foreach (i; 0 .. N) {
        uf.connect(as[i][1], i);
      }
      if (-uf[uf.root(0)] == N) {
        bool found;
        foreach (i; 0 .. N - 1) {
          found = found || (as[i + 1][0] <= P[i].b);
        }
        debug {
          writeln("found = ", found);
        }
        ans = ans && found;
      }
      
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}
