#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod



signed main(){

    int N; cin >> N;
    vec A(N); cin >> A;
    vec B(N); cin >> B;

    pairs pa(N), pb(N);
    REP(i, N){
        pa[i] = Pii(A[i], i);
        pb[i] = Pii(B[i], i);
    }
    Sort(pa); Sort(pb);

    vec inva(N), invb(N);
    REP(i, N){
        inva[pa[i].s] = i;
        invb[pb[i].s] = i;
    }

    vec c0(N + 1, 0), c1(N + 1, 0), c2(N + 1, 0);
    REP(i, N){
        if(pa[i].f <= pb[i].f) c1[i + 1]++;
        if(i > 0 && pa[i].f <= pb[i - 1].f) c0[i + 1]++;
        if(i < N - 1 && pa[i].f <= pb[i + 1].f) c2[i + 1]++;
    }
    REP(i, N){
        c0[i + 1] += c0[i];
        c1[i + 1] += c1[i];
        c2[i + 1] += c2[i];
    }

    bool ans = false;
    REP(r, N) if(A[r] <= B[r]){
        int i = inva[r], j = invb[r];
        int t = 0;
        if(i == j){
            t = c1[N] - (c1[i + 1] - c1[i]);
        }else if(i < j){
            t = c1[N] - (c1[j + 1] - c1[i]) + (c0[j + 1] - c0[i + 1]);
        }else{
            t = c1[N] - (c1[i + 1] - c1[j]) + (c2[i] - c2[j]);
        }

        if(t == N - 1) ans = true;
    }

    if(!ans){
        vec e(N);
        REP(i, N) e[pa[i].s] = pb[i].s;
        int cnt = 0, now = 0;
        do{
            now = e[now];
            cnt++;
        } while(now != 0);
        if(cnt < N){
            ans = true;
            REP(i, N) if(pa[i].f > pb[i].f) ans = false;
        }
    }

    Ans(ans, "Yes", "No");

    return 0;
}


Measured memory_bytes: 9600