#include <bits/stdc++.h>

using namespace std;

const int maxN = 100000;

int N;
int A[maxN];
int B[maxN];
int av[maxN];
int bv[maxN];
int p[maxN];
bool vis[maxN];

bool answer() {
	memcpy(av, A, sizeof A[0] * N);
	sort(av, av + N);
	memcpy(bv, B, sizeof B[0] * N);
	sort(bv, bv + N);
	for (int i = 0; i < N; i++) {
		if (av[i] > bv[i])
			return false;
	}
	for (int i = 1; i < N; i++) {
		if (av[i] <= bv[i - 1])
			return true;
	}
	for (int i = 0; i < N; i++) {
		int u = lower_bound(av, av + N, A[i]) - av;
		int v = lower_bound(bv, bv + N, B[i]) - bv;
		p[u] = v;
	}
	int c = 0;
	for (int i = 0; i < N; i++) {
		if (vis[i])
			continue;
		for (int u = i; !vis[u]; u = p[u])
			vis[u] = true;
		c++;
	}
	return c > 1;
}

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

	cin >> N;
	for (int i = 0; i < N; i++)
		cin >> A[i];
	for (int i = 0; i < N; i++)
		cin >> B[i];

	cout << (answer() ? "Yes" : "No") << '\n';

	return 0;
}
