#include<iostream>
#include<algorithm>
using namespace std;
int n;
pair<int,int> a[100005], b[100005];
int vis[100005], p[100005];
int main()
{
	cin >> n;
	for (int i = 0; i < n; i++)cin >> a[i].first, a[i].second = i;
	for (int i = 0; i < n; i++)cin >> b[i].first, b[i].second = i;
	sort(a, a + n);
	sort(b, b + n);
	for (int i = 0; i < n; i++)
		if (a[i].first > b[i].first)
		{
			cout << "No\n";
			return 0;
		}
	// 必然能通过n-1次交换完成归位
	
	int cnt = 1, cur = 0;
	for (int i = 0; i < n; i++)
		p[a[i].second] = b[i].second;
	while (!vis[cur])
	{
		vis[cur] = true;
		cur = p[cur];
	}
	for (int i = 0; i < n; i++)
		if (!vis[i])
		{
			cnt++; break;
		}
	if (cnt == 2)	// 至少有两个 circles
	{
		cout << "Yes\n";
		return 0;
	}
	for (int i = 0; i < n - 1; i++)
	{
		if (b[i].first >= a[i + 1].first)
			// 说明 i+1 和 i 可以交换
			// (p1,...pn)不是唯一满足条件的交换结果
		{
			cout << "Yes\n";
			return 0;
		}
	}
	cout << "No\n";
	return 0;
}