Problem:
Score : 200 points

Problem Statement

We have a sequence p = {p_1,\ p_2,\ ...,\ p_N} which is a permutation of {1,\ 2,\ ...,\ N}.

You can perform the following operation at most once: choose integers i and j (1 \leq i < j \leq N), and swap p_i and p_j. Note that you can also choose not to perform it.

Print YES if you can sort p in ascending order in this way, and NO otherwise.

Constraints

All values in input are integers.

2 \leq N \leq 50

p is a permutation of {1,\ 2,\ ...,\ N}.

Input

Input is given from Standard Input in the following format:

N
p_1 p_2 ... p_N

Output

Print YES if you can sort p in ascending order in the way stated in the problem statement, and NO otherwise.

Sample Input 1

5
5 2 3 4 1

Sample Output 1

YES

You can sort p in ascending order by swapping p_1 and p_5.

Sample Input 2

5
2 4 3 5 1

Sample Output 2

NO

In this case, swapping any two elements does not sort p in ascending order.

Sample Input 3

7
1 2 3 4 5 6 7

Sample Output 3

YES

p is already sorted in ascending order, so no operation is needed.

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using BitArray = System.Collections.BitArray;
using BigInteger = System.Numerics.BigInteger;

namespace AtCoderProject
{
    public class Program
    {
        public object Calc()
        {
            var N = consoleReader.Int;
            var p = consoleReader.Split.Int;
            var sorted = p.OrderBy(i => i).ToArray();

            var sameCount = 0;
            for (int i = 0; i < p.Length; i++)
            {
                if (p[i] == sorted[i]) sameCount++;
            }

            return sameCount >= p.Length - 2 ? "YES" : "NO";
        }
        #region いつもの
        private readonly ConsoleReader consoleReader;
        public Program(ConsoleReader consoleReader) { this.consoleReader = consoleReader; }
        static void Main() => Console.WriteLine(new Program(new ConsoleReader()).Calc()); static string AllLines<T>(IEnumerable<T> source) => string.Join("\n", source);
        #endregion
    }
    class GraphBuilder
    {
        private List<int>[] lists;
        public GraphBuilder(int count)
        {
            this.lists = new List<int>[count];
            for (int i = 0; i < count; i++)
                this.lists[i] = new List<int>();
        }
        public GraphBuilder(int count, IEnumerable<int[]> arrays) : this(count)
        {
            foreach (var item in arrays)
                this.Add(item[0] - 1, item[1] - 1);
        }
        public void Add(int from, int to)
        {
            this.lists[from].Add(to);
        }
        public int[][] ToArray()
        {
            var N = this.lists.Length;
            var res = new int[N][];
            for (int i = 0; i < N; i++)
                res[i] = this.lists[i].ToArray();
            return res;
        }
    }

    struct Mod : IEquatable<Mod>
    {
        public const long mod = 1000000007;
        public readonly long val;
        public Mod(long val) { this.val = val; }
        public override bool Equals(object obj) => (obj is Mod) ? this == ((Mod)obj) : false;
        public bool Equals(Mod obj) => this == obj;
        public override int GetHashCode() => val.GetHashCode();
        public override string ToString() => val.ToString();
        public static implicit operator Mod(long x) => new Mod(x);
        public static Mod operator +(Mod x, Mod y) => (x.val + y.val) % mod;
        public static Mod operator -(Mod x, Mod y) => x.val >= y.val ? (x.val - y.val) % mod : (x.val - y.val) % mod + mod;
        public static Mod operator *(Mod x, Mod y) => (x.val * y.val) % mod;
        public static Mod operator /(Mod x, Mod y) => x * y.Inverse();
        public static bool operator ==(Mod x, Mod y) => x.val == y.val;
        public static bool operator !=(Mod x, Mod y) => x.val != y.val;
        public Mod Inverse()
        {
            long a = val, b = mod, u = 1, v = 0;
            while (b > 0)
            {
                long t = a / b;
                var b2 = a - t * b;
                a = b; b = b2;
                var v2 = u - t * v;
                u = v; v = v2;
            }
            u %= mod;
            if (u < 0) u += mod;
            return u;
        }
        public static Mod Pow(Mod x, int y)
        {
            Mod res = 1;
            for (; y > 0; y >>= 1)
            {
                if ((y & 1) == 1) res *= x;
                x *= x;
            }
            return res;
        }

        public static Factor CreateFactor(int max) => new Factor(max);
        public class Factor
        {
            private readonly Mod[] fac, finv;
            public Factor(int max)
            {
                var inv = new Mod[max];
                fac = new Mod[max]; finv = new Mod[max];
                fac[0] = fac[1] = 1;
                finv[0] = finv[1] = 1;
                inv[1] = 1;
                for (int i = 2; i < max; i++)
                {
                    fac[i] = fac[i - 1] * i;
                    inv[i] = mod - inv[mod % i].val * (mod / i) % mod;
                    finv[i] = finv[i - 1] * inv[i];
                }
            }

            // 二項係数計算
            public Mod Combine(int n, int k)
            {
                if (n < k) return 0;
                if (n < 0 || k < 0) return 0;
                return fac[n] * finv[k] * finv[n - k];
            }

            public Mod Factorial(int n) => fac[n];
            public Mod FactorialInvers(int n) => finv[n];
        }
    }

#pragma warning disable
    public class ConsoleReader { public class SplitLine { string[] splited; public SplitLine(string line) { splited = line.Split(); } public string[] String => splited.ToArray(); public int[] Int => splited.Select(int.Parse).ToArray(); public long[] Long => splited.Select(long.Parse).ToArray(); public ulong[] ULong => splited.Select(ulong.Parse).ToArray(); public double[] Double => splited.Select(double.Parse).ToArray(); } public class RepeatLine { ConsoleReader reader; int num; public RepeatLine(ConsoleReader reader, int num) { this.reader = reader; this.num = num; } public IEnumerable<string> String { get { for (int i = 0; i < num; i++) yield return reader.String; } } public IEnumerable<int> Int { get { for (int i = 0; i < num; i++) yield return reader.Int; } } public IEnumerable<long> Long { get { for (int i = 0; i < num; i++) yield return reader.Long; } } public IEnumerable<string[]> SplitString { get { for (int i = 0; i < num; i++) yield return reader.Split.String; } } public IEnumerable<int[]> SplitInt { get { for (int i = 0; i < num; i++) yield return reader.Split.Int; } } } public virtual string String => Console.ReadLine(); public int Int => int.Parse(String); public long Long => long.Parse(String); public ulong ULong => ulong.Parse(String); public double Double => double.Parse(String); public SplitLine Split => new SplitLine(String); public RepeatLine Repeat(int count) => new RepeatLine(this, count); }
}