#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;

class UnionFind{
  vector<int> parent, depth, size;
  int count;
public:
  UnionFind(int n): parent(n), depth(n,1), size(n,1), count(n){
    iota(ALL(parent),0);
  }
  int get_root(int i){
    if(parent[i] == i) return i;
    else return parent[i] = get_root(parent[i]);
  }
  bool is_same(int i, int j){return get_root(i) == get_root(j);}
  int merge(int i, int j){
    int ri = get_root(i), rj = get_root(j);
    if(ri == rj) return ri;
    else{
      --count;
      if(depth[ri] < depth[rj]){
        parent[ri] = rj;
        size[rj] += size[ri];
        return rj;
      }else{
        parent[rj] = ri;
        size[ri] += size[rj];
        if(depth[ri] == depth[rj]) ++depth[ri];
        return ri;
      }
    }
  }
  int get_size(int i){return size[get_root(i)];}
  int count_group(){return count;}
};



bool solve(int N, vector<int> A, vector<int> B){
  //  if(*max_element(ALL(B)) < *max_element(ALL(A))) return false;

  {
    auto a = A;
    auto b = B;

    sort(ALL(a));
    sort(ALL(b));

    REP(i,N){
      if(a[i] > b[i]) return false;
    }
  }

  multiset<pair<int,int>> m1; // a > b
  multiset<pair<int,int>> m2; // a <= b


  vector<int> ord(N);
  iota(ALL(ord), 0);

  sort(ALL(ord), [&](int i, int j){return B[i] == B[j] ? A[i] < A[j] : B[i] < B[j];});

  {
    vector<int> temp(N);
    REP(i,N){
      temp[i] = B[ord[i]];
    }
    swap(B, temp);
  }

  {
    vector<int> temp(N);
    REP(i,N){
      temp[i] = A[ord[i]];
    }
    swap(A, temp);
  }

  vector<int> p(N);
  iota(ALL(p), 0);

  sort(ALL(p), [&](int i, int j){return A[i] < A[j];});

  dump(A, B);

  dump(p);

  
  
  UnionFind uf(N);

  REP(i,N){
    uf.merge(i, p[i]);
  }

  if(uf.count_group() >= 2) return true;
  

  REP(i,N-1){
    if(A[p[i+1]] <= B[i]) return true;
  }

  return false;
}



int main(){
  int N;
  while(cin >> N){
    vector<int> A(N), B(N); cin >> A >> B;

    bool ans = solve(N, A, B);

    cout << (ans ? "Yes" : "No") << endl;
  }
  
  return 0;
}


Measured memory_bytes: 3808