#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

//vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
//vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

vector<ll> dy = {1, 0, 1};
vector<ll> dx = {0, 1, 1};



void pres(double A, ll x = 10){cout << fixed << setprecision(x) << A << endl;}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};


//Union Find
const ll MAX_V = 1000010;

ll par[MAX_V];//
ll Rank[MAX_V];
ll child[MAX_V];

void init_UF(){
  for(ll i = 0; i < MAX_V; i++){
    par[i] = i;
    Rank[i] = 1;
    child[i] = 1;
  }
}

ll find(ll x){
  if(par[x] == x) return x;
  else{
    return par[x] = find(par[x]);
  }
}

bool same(ll x, ll y){
  return find(x) == find(y);
}

void unite(ll x, ll y){
  ll rx = find(x), ry = find(y);
  if(rx != ry){
    if(Rank[rx] >= Rank[ry]){
      par[ry] = rx;
      if(Rank[rx] == Rank[ry]) Rank[rx]++;
      child[rx] += child[ry];
    }else{
      par[rx] = ry;
      child[ry] += child[rx];
    }
  }
}


ll N;
vector<pair<ll, ll>> BA;

void solve(){
  cin >> N;
  BA.resize(N);
  rep(i, N) cin >> BA[i].s;
  rep(i, N) cin >> BA[i].f;
  sort(BA.begin(), BA.end());
  //N-1回必要かどうか

  //そもそも可能かどうか
  vector<ll> tmpA(N), tmpB(N);
  rep(i, N){
    tmpA[i] = BA[i].s;
    tmpB[i] = BA[i].f;
  }
  sort(tmpA.begin(), tmpA.end());
  sort(tmpB.begin(), tmpB.end());
  rep(i, N){
    if(tmpA[i] > tmpB[i]){
      cout << "No" << endl;
      return;
    }
  }

  rep(i, N-1){
    if(tmpA[i] <= tmpB[i+1] && tmpA[i+1] <= tmpB[i]){
      cout << "Yes" << endl;
      return;
    }
  }
  //sortする必要がある
  map<ll, ll> TO;
  rep(i, N){
    TO[tmpA[i]] = i;
  }
  init_UF();
  rep(i, N){
    unite(i, TO[BA[i].s]);
  }
  ll p = find(0);
  rep(i, N){
    if(find(i) != p){
      cout << "Yes" << endl;
      return;
    }
  }
  cout << "No" << endl;


}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 33024