#include <iostream>
#include <algorithm>
#include <utility>
#define pii pair<int, int>
#define piii pair<pii, int>
#define pll pair<long long, long long>
#define ff first
#define ss second

using namespace std;

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

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

    pii C[n]; for(int i = 0; i < n; ++i) C[i] = {B[i], A[i]};
    sort(C, C + n);
    pii D[n]; for(int i = 0; i < n; ++i) D[i] = {C[i].ss, i};
    sort(D, D + n);

    for(int i = 0; i < n; ++i)
    if(C[i].ff < D[i].ff) {cout << "No"; return 0;}
    for(int i = 1; i < n; ++i)
    if(C[i - 1].ff >= D[i].ff) {cout << "Yes"; return 0;}

    int cnt = 1, pnt = D[0].ss;
    while(pnt) pnt = D[pnt].ss, ++cnt;
    cout << (cnt == n ? "No" : "Yes");
    return 0;
}
