import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.util.HashMap;
import java.io.IOException;
import java.util.Random;
import java.io.UncheckedIOException;
import java.util.Map;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) throws Exception {
        Thread thread = new Thread(null, new TaskAdapter(), "", 1 << 27);
        thread.start();
        thread.join();
    }

    static class TaskAdapter implements Runnable {
        @Override
        public void run() {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            FastInput in = new FastInput(inputStream);
            FastOutput out = new FastOutput(outputStream);
            TaskC solver = new TaskC();
            solver.solve(1, in, out);
            out.close();
        }
    }

    static class TaskC {
        public void solve(int testNumber, FastInput in, FastOutput out) {
            int n = in.readInt();
            int[] a = new int[n];
            int[] b = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = in.readInt();
            }
            for (int i = 0; i < n; i++) {
                b[i] = in.readInt();
            }

            int failCnt = 0;
            for (int i = 0; i < n; i++) {
                if (a[i] > b[i]) {
                    failCnt++;
                }
            }

            int[] oldA = a.clone();
            int[] oldB = b.clone();

            Randomized.randomizedArray(a, 0, n);
            Randomized.randomizedArray(b, 0, n);

            Arrays.sort(a);
            Arrays.sort(b);

            for (int i = 0; i < n; i++) {
                if (a[i] > b[i]) {
                    out.println("No");
                    return;
                }
            }

            boolean flexible = false;
            for (int i = 1; i < n; i++) {
                if (a[i] <= b[i - 1]) {
                    out.println("Yes");
                    return;
                }
            }

            Map<Integer, Integer> bIndex = new HashMap<>();
            for (int i = 0; i < n; i++) {
                bIndex.put(oldB[i], i);
            }

            int timeNeed = 0;
            for (int i = 0; i < n; i++) {
                int aRank = SequenceUtils.floorIndex(a, oldA[i], 0, n - 1);
                int bPos = bIndex.get(b[aRank]);
                if (bPos == i) {
                    continue;
                }
                timeNeed++;
                SequenceUtils.swap(oldB, i, bPos);
                bIndex.put(oldB[i], i);
                bIndex.put(oldB[bPos], bPos);
            }
            if (timeNeed > n - 2) {
                out.println("No");
            } else {
                out.println("Yes");
            }
        }

    }

    static class SequenceUtils {
        public static int floorIndex(int[] data, int x, int l, int r) {
            int index = Arrays.binarySearch(data, l, r + 1, x);
            if (index < 0) {
                return -(index + 1) - 1;
            }
            return index;
        }

        public static void swap(int[] data, int i, int j) {
            int tmp = data[i];
            data[i] = data[j];
            data[j] = tmp;
        }

    }

    static class FastInput {
        private final InputStream is;
        private byte[] buf = new byte[1 << 13];
        private int bufLen;
        private int bufOffset;
        private int next;

        public FastInput(InputStream is) {
            this.is = is;
        }

        private int read() {
            while (bufLen == bufOffset) {
                bufOffset = 0;
                try {
                    bufLen = is.read(buf);
                } catch (IOException e) {
                    bufLen = -1;
                }
                if (bufLen == -1) {
                    return -1;
                }
            }
            return buf[bufOffset++];
        }

        public void skipBlank() {
            while (next >= 0 && next <= 32) {
                next = read();
            }
        }

        public int readInt() {
            int sign = 1;

            skipBlank();
            if (next == '+' || next == '-') {
                sign = next == '+' ? 1 : -1;
                next = read();
            }

            int val = 0;
            if (sign == 1) {
                while (next >= '0' && next <= '9') {
                    val = val * 10 + next - '0';
                    next = read();
                }
            } else {
                while (next >= '0' && next <= '9') {
                    val = val * 10 - next + '0';
                    next = read();
                }
            }

            return val;
        }

    }

    static class FastOutput implements AutoCloseable, Closeable {
        private StringBuilder cache = new StringBuilder(10 << 20);
        private final Writer os;

        public FastOutput(Writer os) {
            this.os = os;
        }

        public FastOutput(OutputStream os) {
            this(new OutputStreamWriter(os));
        }

        public FastOutput println(String c) {
            cache.append(c).append('\n');
            return this;
        }

        public FastOutput flush() {
            try {
                os.append(cache);
                os.flush();
                cache.setLength(0);
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
            return this;
        }

        public void close() {
            flush();
            try {
                os.close();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public String toString() {
            return cache.toString();
        }

    }

    static class Randomized {
        static Random random = new Random();

        public static void randomizedArray(int[] data, int from, int to) {
            to--;
            for (int i = from; i <= to; i++) {
                int s = nextInt(i, to);
                int tmp = data[i];
                data[i] = data[s];
                data[s] = tmp;
            }
        }

        public static int nextInt(int l, int r) {
            return random.nextInt(r - l + 1) + l;
        }

    }
}



Measured memory_bytes: 72116