///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define PI  (3.1415926535)

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
T get_m(M<TT, T> &m, TT k, T default_value)
{
    if (m.find(k) == m.end()) return m[k] = default_value;
    return m[k];
}

template <typename TT, typename T>
void incr_m(M<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(auto &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(auto &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

void _debug_print(auto x)
{
    cout << x << endl;
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "-- " << x1 << " -- " << x2
         << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) {
        cout << "-- ";
        _debug_print(x);
    }
}

template <typename TT, typename T>
void _debug_print(const M<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "====" << endl;
        cout << "K=";
        _debug_print(k);
        cout << "V=";
        _debug_print(v);
    }
}

void _debug_print_time(const char *prefix)
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    struct tm *tm = localtime(&tv.tv_sec);
    printf("-- %s %02d:%02d:%02d.%06ld\n",
           prefix, tm->tm_hour, tm->tm_min, tm->tm_sec, tv.tv_usec);
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

bool judge_no(V<ll> alist, V<ll>blist, ll n)
{
    sort(alist);
    sort(blist);
    rep (i, n) if (alist[i] > blist[i]) return true;
    return false;
}

bool judge_yes(V<ll> alist, V<ll>blist, ll n)
{
    sort(alist);
    sort(blist);
    rep (i, n-1) if (alist[i+1] <= blist[i]) return true;
    return false;
}

void make_map(M<ll, ll> &validx, V<ll> alist, ll n)
{
    sort(alist);
    rep (i, n) {
        ll val = alist[i];
        assert(validx.find(val) == validx.end());
        validx[val] = i;
    }
}

bool judge(V<ll> alist, V<ll>blist, ll n)
{
    S M<ll, ll> validx_a;
    make_map(validx_a, alist, n);
    debug_printf("---- validx_a\n");
    debug_print(validx_a);

    S M<ll, ll> validx_b;
    make_map(validx_b, blist, n);
    debug_printf("---- validx_b\n");
    debug_print(validx_b);

    rep (i, n) alist[i] = validx_a[alist[i]];
    rep (i, n) blist[i] = validx_b[blist[i]];

    debug_printf("---- alist\n");
    debug_print(alist);
    debug_printf("---- blist\n");
    debug_print(blist);

    validx_a.clear();
    rep (i, n) {
        assert(validx_a.find(alist[i]) == validx_a.end());
        validx_a[alist[i]] = i;
    }

    ll init = alist[0];
    ll now = alist[0];
    ll cnt = 0;
    while (1) {
        cnt++;
        ll idx = validx_a[now];
        ll now_b = blist[idx];
        ll nidx = validx_a[now_b];
        now = alist[nidx];
        if (now == init) break;
    }

    debug_printf("n=%lld cnt=%lld\n", n, cnt);

    return cnt < n;
}

void _main()
{
    ll n; llin(n);
    S V<ll> alist; llina(alist, n);
    S V<ll> blist; llina(blist, n);

    if (judge_no(alist, blist, n)) {
        cout << "No" << endl;
        return;
    }

    if (judge_yes(alist, blist, n)) {
        cout << "Yes" << endl;
        return;
    }

    if (judge(alist, blist, n)) {
        cout << "Yes" << endl;
        return;
    }

    cout << "No" << endl;
}

///////////////////////////////////////////////////////////////////////////////


Measured memory_bytes: 12356