#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

typedef long long int ll;
using ll = long long int;
using ull = long long unsigned int;
using Int = long long int;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//edit
class UnionFind {
    vector<int> p;//p[i]はiの属する組織
public:
    UnionFind(int n) {
        p = vector<int>(n);
        for (int i = 0; i < n; i++) {
            p[i] = i;
        }
        return;
    }

/* xの属する集合を返す */
    int find(int x) {
        if (p[x] == x) return x;
        return p[x] = find(p[x]);
    }

/* yにxを統合する */
    void unite(int x, int y) {
        p[find(x)] = p[find(y)];
    }

/* xとyが属する集合が同じかを判定する */
    bool same(int x, int y) {
        return find(x) == find(y);
    }

};

class Solve {
public:
    Int N;
    vector<Int> A, B;

    bool firstCheck() {
        vector<Int> X = A;
        vector<Int> Y = B;
        sort(all(X));
        sort(all(Y));
        for (int i = 0; i < N; ++i) {
            if (X[i] > Y[i]) {
                return false;
            }
        }
        return true;
    }

    bool secondCheck() {
        vector<Int> X = A;
        vector<Int> Y = B;
        sort(all(X));
        sort(all(Y));
        for (int i = 0; i < N; ++i) {
            int idx = upper_bound(all(X), Y[i]) - X.begin();
            if (idx > i + 1) return true;
        }

        return false;
    }

//    bool thirdCheck() {
//        vector<Int> X = A;
//        vector<Int> Y = B;
//        vector<pair<Int, Int>> AB(N);
//        for (int i = 0; i < N; ++i) {
//            AB[i].first = A[i];
//            AB[i].second = B[i];
//        }
//        sort(all(X));
//        sort(all(Y));
//        sort(all(AB), [](pair<Int, Int> a, pair<Int, Int> b) {
//            return a.second < b.second;
//        });
//
//        int cnt = 0;
//        for (int i = 0; i < N; ++i) {
//            if (AB[i].first != X[i]) {
//                cnt++;
//            }
//        }
//
//        return cnt < N;
//    }

    bool thirdCheck() {
        vector<Int> P = A;
        vector<Int> Q = B;
        sort(all(P));
        sort(all(Q));
        map<Int, Int> iP;
        map<Int, Int> iQ;
        for (int i = 0; i < N; ++i) {
            iP[P[i]] = i;
            iQ[Q[i]] = i;
        }

        vector<Int> X(N), Y(N);
        vector<pair<Int, Int>> AB(N);


        for (int i = 0; i < N; ++i) {
            X[i] = iP[A[i]];
            Y[i] = iQ[B[i]];
            AB[i].first = iP[A[i]];
            AB[i].second = iQ[B[i]];
        }


        UnionFind uf(N);
        for (int i = 0; i < N; ++i) {
            Int tapi = AB[i].first;
            Int tapu = AB[i].second;
            if (!uf.same(tapi, tapu)) {
                uf.unite(tapi, tapu);
            }
        }
        set<Int> neri;
        for (int i = 0; i < N; ++i) neri.insert(uf.find(i));

        Int gr = neri.size();
        return gr >= 2;
    }

    void solve() {
        cin >> N;
        A.resize(N);
        B.resize(N);
        for (auto &a : A) cin >> a;
        for (auto &b : B) cin >> b;
        if (!firstCheck()) {
            cout << "No" << endl;
            return;
        }
        if (secondCheck()) {
            cout << "Yes" << endl;
            return;
        }

//        int cnt = 0;
//        for (int i = 0; i < N; ++i) {
//            if (A[i] > B[i]) {
//                cnt++;
//            }
//        }
//        if (cnt <= N - 2) {
//            cout << "Yes" << endl;
//        } else {
//            cout << "No" << endl;
//        }

        if (thirdCheck()) {
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
        }

    }
};


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);

    Solve().solve();


    return 0;
}


Measured memory_bytes: 19284