#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
const ll MOD = 1000000007;
const ll INF = 4611686018427387903;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()

int main(){
	int n; cin >> n;
	VI a(n), b(n);
	REP(i,n) cin >> a[i];
	REP(i,n) cin >> b[i];
	vector<P> ap(n), bp(n);
	REP(i,n){
		ap[i].first=a[i];
		ap[i].second=i;
		bp[i].first=b[i];
		bp[i].second=i;
	}
	sort(ALL(ap));
	sort(ALL(bp));
	VI p(n);
	REP(i,n) p[ap[i].second]=bp[i].second;
	sort(ALL(a));
	sort(ALL(b));
	vector<bool> f(n,0); 
	int now=0; f[0]=1;
	while(1){
		now=p[now];
		if(f[now])
			break;
		f[now]=1;
	}
	bool rp=1;
	REP(i,n){
		if(!f[i]){
			rp=0;
			break;
		}
	}
	bool no=0, ok=0;
	REP(i,n){
		if(a[i]>b[i]){
			no=1;
			break;
		}
		if(i<n-1){
			if(a[i+1]<=b[i])
				ok=1;
		}
	}
	if(no||(rp&&!ok))
		cout << "No" << endl;
	else
		cout << "Yes" << endl;
	return 0;
}