#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef pair<ll,ll> pll;


const ll inf=10000000000;

#define rep(i,m,n) for(int i=m;i<n;i++)


int main(){
   cin.tie(nullptr);
  ios::sync_with_stdio(false);

 ll n;
  cin >> n;
  vector<pll> a(n),b(n);
  rep(i,0,n) {
    cin >> a[i].first;
    a[i].second=i;
  }
    rep(i,0,n){
      cin >> b[i].first;
      b[i].second=i;
    }
  
  sort(a.begin(),a.end());
  sort(b.begin(),b.end());
 
  rep(i,0,n) if(a[i].first>b[i].first) {
    cout << "No" << endl;
    return 0;
  }
  rep(i,0,n-1) if(a[i+1].first<=b[i].first) {
    cout << "Yes" << endl; 
    return 0;
  }
  
  
  vll pos(n);
  rep(i,0,n) pos[a[i].second]=b[i].second;
  
  ll x=0,cnt=0;
  do{
    x=pos[x];
    cnt++;
  }while(x!=0);
    
    if(cnt!=n) cout <<"Yes" << endl;
   else cout << "No" << endl;


}
