#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>

using namespace std;
using ll = long long;

void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void _cout(){ cout << "\n"; } template <class Head, class... Tail> void _cout(Head&& head, Tail&&... tail){ cout << head; _cout(forward<Tail>(tail)...); }
int gcd(int a, int b){ return (b == 0) ? a : gcd(b, a % b); }
template<typename S, typename T> ostream& operator<<(ostream &os, const pair<S, T> &p){ cout << "[" << p.first << ", " << p.second << "]"; return os; }

#define Sq(x) (x)*(x)
#define For(i, n) for(int i = 0; i < (n); i ++)
#define Rep(n) For(_, n)
#define Range(c) c.begin(), c.end()
#define RevRange(c) c.rbegin(), c.rend()
#define Contains(c, x) (find(Range(c), x) != c.end())
#define Search(rb, re, x) distance(rb, find(rb, re, x))
#define Sort(a) sort(Range(a))
#define DeSort(a) sort(RevRange(a))
#define Reverse(c) reverse(Range(c))
#define Unique(a) a.erase(unique(Range(a)), a.end())
#define Cusum(T, xs, sxs) vector<T> sxs(xs.size()+1); For(i, (int)xs.size()) sxs[i+1] = sxs[i] + xs[i]
#define Cin(T, ...) T __VA_ARGS__; _cin(__VA_ARGS__)
#define Cins(T, n, xs) vector<T> xs(n); For(i, n) cin >> xs[i]
#define Cins2(T, n, xs, ys) vector<T> xs(n), ys(n); For(i, n) cin >> xs[i] >> ys[i]
#define Cins3(T, n, xs, ys, zs) vector<T> xs(n), ys(n), zs(n); For(i, n) cin >> xs[i] >> ys[i] >> zs[i]
#define Cinss(T, n, m, xs) Vec2(T, n, m, xs); For(i, n) For(j, m) cin >> xs[i][j]
#define Cinm(T, n, map) unordered_map<T, int> map; Rep(n){ Cin(T, x); map[x] ++; }
#define Cout(...) _cout(__VA_ARGS__)
#define Couts(xs) { for(const auto &e : xs) cout << e << " "; cout << "\n"; }
#define Coutyn(cond) Cout((cond) ? "yes" : "no")
#define CoutYn(cond) Cout((cond) ? "Yes" : "No")
#define CoutYN(cond) Cout((cond) ? "YES" : "NO")
#define vc vector
#define Mini(a, x) a = min(a, x)
#define Maxi(a, x) a = max(a, x)

// constexpr int MOD = 1e9+7;

struct T{
    int a;
    int b;
};

#include <map>

int main(void){
    Cin(int, n);
    Cins(int, n, a);
    Cins(int, n, b);
    vc<T> p(n);
    For(i, n) p[i].a = a[i], p[i].b = b[i];
    
    Sort(a);
    Sort(b);
    For(i, n){
        if(a[i] > b[i]){
            Cout("No");
            return 0;
        }
    }
    For(i, n-1){
        if(a[i+1] <= b[i]){
            Cout("Yes");
            return 0;
        }
    }
    
    map<int, int> ma; // 値 -> 添え字
    For(i, n) ma[p[i].a] = i;
    int ca = 0, c = 0;
    
    for(auto &e : ma){
        p[e.second].a = ca++;
    }
    sort(Range(p), [](auto &l, auto &r){ return l.b < r.b; });
    // For(i, n) cout << p[i].a << " "; cout << endl;
    for(int i = 0; (c ++, i = p[i].a) != 0; );
    // Cout(c);
    CoutYn(c < n);
    
    /*int n = 5;
    vc<int> a(n);
    For(i, n) a[i] = i;
    
    vc<int> b{1, 2, 3, 4, 4};
    
    do{
        int k = 0;
        For(i, n){
            if(b[a[i]] > b[i]) k ++;
        }
        if(k == n-2){
            For(i, n) cout << b[a[i]] << " ";
            printf("[%d]\n", k);
        }
    }
    while(next_permutation(Range(a)));*/
}




Measured memory_bytes: 6528