#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <iomanip>
#include <utility>
#define ll long long
#define ld long double
using namespace std;

int A[100010], B[100010], E[100010];
pair<int, int> C[100010], D[100010];

int main() {
	int N;
	cin >> N;
	for(int i=0; i<N; ++i){
		cin >> A[i];
		C[i]=make_pair(A[i], i);
	}
	for(int i=0; i<N; ++i){
		cin >> B[i];
		D[i]=make_pair(B[i], i);
	}
	sort(C, C+N);
	sort(D, D+N);
	int cnt=0;
	for(int i=0; i<N; ++i){
		if(C[i].first>D[i].first){
			cout << "No" << endl;
			return 0;
		}
		if(i>0){
			if(C[i].first<=D[i-1].first){
				++cnt;
			}
		}
	}
	if(cnt>0){
		cout << "Yes" << endl;
		return 0;
	}
	for(int i=0; i<N; ++i){
		E[C[i].second]=D[i].second;
	}
	int now=E[0], k=1;
	while(now>0){
		now=E[now];
		++k;
	}
	if(k<N) cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}