import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} import java.io.OutputStream; OutputStream java.io import java.io.IOException; IOException java.io import java.io.InputStream; InputStream java.io import java.io.PrintWriter; PrintWriter java.io import java.util.StringTokenizer; StringTokenizer java.util import java.io.IOException; IOException java.io import java.io.BufferedReader; BufferedReader java.io import java.io.InputStreamReader; InputStreamReader java.io import java.io.InputStream; InputStream java.io public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} Main public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    } main {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    } InputStream inputStream = System.in; inputStream System.in System System.in OutputStream outputStream = System.out; outputStream System.out System System.out InputReader in = new InputReader(inputStream); in new InputReader(inputStream) PrintWriter out = new PrintWriter(outputStream); out new PrintWriter(outputStream) TaskB solver = new TaskB(); solver new TaskB() solver.solve(1, in, out) solver.solve solver 1 in out out.close() out.close out String[] args args static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        }

    } TaskB public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        } solve {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        } int n = in.nextInt(); n in.nextInt() in.nextInt in int[] ar = new int[n]; ar new int[n] n for (int i = 0; i < n; i++)
                ar[i] = in.nextInt(); int i = 0; int i = 0; i 0 i < n i n i++ i++ i ar[i] = in.nextInt(); ar[i] = in.nextInt() ar[i] ar i in.nextInt() in.nextInt in boolean ok = true; ok true for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                } int i = 0; int i = 0; i 0 i < n - 1 i n - 1 n 1 i++ i++ i if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                } if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                } ar[i] > ar[i + 1] ar[i] ar i ar[i + 1] ar i + 1 i 1 {
                    ok = false;
                    break;
                } ok = false ok false break; if (ok) {
                out.println("YES");
                return;
            } ok {
                out.println("YES");
                return;
            } out.println("YES") out.println out "YES" return; for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                } int i = 0; int i = 0; i 0 i < n - 1 i n - 1 n 1 i++ i++ i for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                } for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                } int j = i + 1; int j = i + 1; j i + 1 i 1 j < n j n j++ j++ j {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                } {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                } int t = ar[i]; t ar[i] ar i ar[i] = ar[j] ar[i] ar i ar[j] ar j ar[j] = t ar[j] ar j t ok = true ok true for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        } int k = 0; int k = 0; k 0 k < n - 1 k n - 1 n 1 k++ k++ k if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        } if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        } ar[k] > ar[k + 1] ar[k] ar k ar[k + 1] ar k + 1 k 1 {
                            ok = false;
                            break;
                        } ok = false ok false break; if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    } ok {
                        out.println("YES");
                        return;
                    } out.println("YES") out.println out "YES" return; {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    } t = ar[i] t ar[i] ar i ar[i] = ar[j] ar[i] ar i ar[j] ar j ar[j] = t ar[j] ar j t out.println("NO") out.println out "NO" int testNumber testNumber InputReader in in PrintWriter out out static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    } InputReader public BufferedReader reader; reader public StringTokenizer tokenizer; tokenizer public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        } InputReader {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        } reader = new BufferedReader(new InputStreamReader(stream), 32768) reader new BufferedReader(new InputStreamReader(stream), 32768) tokenizer = null tokenizer null InputStream stream stream public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } next {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        } while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } tokenizer == null || !tokenizer.hasMoreTokens() tokenizer == null tokenizer null !tokenizer.hasMoreTokens() tokenizer.hasMoreTokens() tokenizer.hasMoreTokens tokenizer {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            } try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                } IOException e {
                    throw new RuntimeException(e);
                } throw new RuntimeException(e); new RuntimeException(e) {
                    tokenizer = new StringTokenizer(reader.readLine());
                } tokenizer = new StringTokenizer(reader.readLine()) tokenizer new StringTokenizer(reader.readLine()) return tokenizer.nextToken(); tokenizer.nextToken() tokenizer.nextToken tokenizer public int nextInt() {
            return Integer.parseInt(next());
        } nextInt {
            return Integer.parseInt(next());
        } return Integer.parseInt(next()); Integer.parseInt(next()) Integer.parseInt Integer next() next public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
} Main
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] ar = new int[n];
            for (int i = 0; i < n; i++)
                ar[i] = in.nextInt();
            boolean ok = true;
            for (int i = 0; i < n - 1; i++)
                if (ar[i] > ar[i + 1]) {
                    ok = false;
                    break;
                }
            if (ok) {
                out.println("YES");
                return;
            }
            for (int i = 0; i < n - 1; i++)
                for (int j = i + 1; j < n; j++) {
                    int t = ar[i];
                    ar[i] = ar[j];
                    ar[j] = t;
                    ok = true;
                    for (int k = 0; k < n - 1; k++)
                        if (ar[k] > ar[k + 1]) {
                            ok = false;
                            break;
                        }
                    if (ok) {
                        out.println("YES");
                        return;
                    } else {
                        t = ar[i];
                        ar[i] = ar[j];
                        ar[j] = t;
                    }
                }
            out.println("NO");
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}