#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;

#define oset tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update> 

#define ll long long

#ifdef sarthak
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
int begtime = clock();
#else
#define trace(...)
#endif

#ifndef sarthak
    #pragma GCC optimize("Ofast")
    #pragma GCC optimize("unroll-loops")
    // #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif

#define foreach(it,ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fort(i,v) for(auto i:v)
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar,val) rep(i,sizeof(ar)/sizeof(ll)) ar[i]=val
#define fill2(ar,val) rep(i,sizeof(ar)/sizeof(ar[0])) rep(j,sizeof(ar[0])/sizeof(ll)) ar[i][j]=val
#define fill0(ar) memset(ar,0,sizeof(ar))
#define debug(x) cout<<#x<<": "<<x<<endl

#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sd(x) scanf("%d",&x)
#define slld(x) scanf("%lld",&x)
#define sd2(x,y) scanf("%d %d",&x,&y)
#define slld2(x,y) scanf("%lld %lld",&x,&y)
#define pd(x) printf("%d\n",x)
#define plld(x) printf("%lld\n",x)
#define pd2(x,y) printf("%d %d\n",x,y)
#define plld2(x,y) printf("%lld %lld\n",x,y)
#define all(ar) ar.begin(), ar.end()
#define endl '\n'
#define sz(x) (int)x.size()
#define len(x) (int)x.length()

typedef pair<ll, ll> ii;
typedef pair<ii, ll> iii;
typedef vector<ii> vii;
typedef vector<ll> vi;

#define INF 1000000000000000000
#define PI 3.14159265358979323846L

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngb(chrono::steady_clock::now().time_since_epoch().count()); // can give negative values too

const ll N = 300001;
ll seg[4*N];
set<ll> s[N];

void update(ll st, ll en, ll ind, ll i, ll val)
{
    if(st>i || en<i)
        return;
    if(st==i && en==i)
    {
        seg[ind] = val;
        return;
    }

    ll mid = (st+en)/2;

    update(st,mid,2*ind,i,val);
    update(mid+1,en,2*ind+1,i,val);
    seg[ind] = max(seg[2*ind], seg[2*ind+1]);
}

ll query(ll st, ll en, ll ind, ll il, ll ir)
{
    if(st>ir || en<il)
        return -INF;
    if(st>=il && en<=ir)
        return seg[ind];

    ll mid = (st+en)/2;
    return max(query(st,mid,2*ind,il,ir), query(mid+1,en,2*ind+1,il,ir));
}

void solve()
{
    ll n;
    cin >> n;

    rep(i,4*N)
    {
        seg[i] = -1;
    }

    pair<ll,ll> p[n];
    rep(i,n)
    {
        cin >> p[i].ss;
    }
    rep(i,n)
    {
        cin >> p[i].ff;
    }

    sort(p,p+n);

    map<ll,ll> coord;
    rep(i,n)
    {
        coord[p[i].ss]++;
        coord[p[i].ff]++;
    }

    ll timer = 0;
    foreach(it,coord)
    {
        timer++;
        it->second = timer;
    }

    rep(i,n)
    {
        p[i].ff = coord[p[i].ff];
        p[i].ss = coord[p[i].ss];
    }

    rep(i,n)
    {
        s[p[i].ss].insert(-i);
        update(1,2*n+100,1,p[i].ss,i);
    }

    ll cnt = 0;

    rep(i,n)
    {
        ll a = p[i].ss;
        ll b = p[i].ff;

        if(a<=b)
        {
            s[a].erase(-i);
            if(s[a].empty())
                update(1,2*n+100,1,a,-1);
            else
                update(1,2*n+100,1,a,-(*(s[a].begin())));
            continue;
        }

        ll ind = query(1,2*n+100,1,1,b);

        if(ind==-1)
        {
            cout << "No" << endl;
            return;
        }

        cnt++;
        ll val = p[ind].ss;
        s[val].erase(-ind);
        s[a].erase(-i);

        if(s[val].empty())
            update(1,2*n+100,1,val,-1);
        else
            update(1,2*n+100,1,val,-(*(s[val].begin())));

        s[a].insert(-ind);
        update(1,2*n+100,1,a,-(*(s[a].begin())));
        p[ind].ss = a;
    }

    if(cnt>n-2)
    {
        cout << "No" << endl;
    }
    else
    {
        cout << "Yes" << endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout << fixed;
    cout << setprecision(10);
    #ifdef sarthak
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif

    ll t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }

    #ifdef sarthak
    cerr << "Time elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
    #endif
}


Measured memory_bytes: 42368