#include <iostream>
#include <cstring>
#include <algorithm>
#include <stdio.h>
using namespace std;
int n;
struct node 
{
	int v;
	int id;
}a[100005],b[100005];
int book[100005];
int to[100005];
bool cmp(node x,node y)
{
	return x.v<y.v;
}
void solve()
{
	sort(a+1,a+n+1,cmp);
	sort(b+1,b+n+1,cmp);
	for(int i=1;i<=n;i++)
	{
		if(a[i].v>b[i].v)
		{
			cout<<"No"<<endl;
			return;
		}
	}
	for(int i=1;i<n;i++)
	{
		if(a[i+1].v<=b[i].v)
		{
			cout<<"Yes"<<endl;
			return;
		}
	}
	for(int i=1;i<=n;i++)
	{
		to[a[i].id]=b[i].id;
	}
	int qnum=0;
	for(int i=1;i<=n;i++)
	{
		int top=i,flag=0;
		while(book[top]==0)
		{
			flag=1;
			book[top]=1;
			top=to[top];
		}
		if(flag) qnum++;
	}
	if(qnum!=1)
	cout<<"Yes"<<endl;
	else
	{
		cout<<"No"<<endl;
	}
}
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	scanf("%d",&a[i].v),a[i].id=i;
	for(int i=1;i<=n;i++)
	scanf("%d",&b[i].v),b[i].id=i;
	solve();
	return 0;
} 