import java.util.Arrays;
import java.util.Scanner;

/**
 * B - 0 or 1 Swap
 */
public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner( System.in );
        // 最大値
        int n = sc.nextInt();
        int[] p = new int[n];
        int[] q = new int[n];
        int replaceCnt = 0;
        String result = "YES";

        for( int i = 0; i < n; i++ ) {
            p[i] = sc.nextInt();
            q[i] = p[i];
        }

//        String beforeStr = Arrays.toString( p );
//        System.out.println( "beforeStr : " + beforeStr);
        Arrays.sort( q );
//        String sortStr = Arrays.toString( p );
//        System.out.println( "sortStr : " + sortStr);
        for( int i = 0; i < n; i++ ) {
//            System.out.println( "beforeStr - " + beforeStr.charAt( i ) + ": sortStr - " + sortStr.charAt( i ) + ": replaceCnt - " + replaceCnt);
            if( p[i] != q[i] ) {
//                System.out.println( "replaceCnt++" );
                replaceCnt++;
//                System.out.println( "beforeStr - " + beforeStr.charAt( i ) + ": sortStr - " + sortStr.charAt( i ) + ": replaceCnt - " + replaceCnt);
                if( replaceCnt > 2 ) {
                    result = "NO";
                    break;
                }
            }
        }

        System.out.println( result );

        sc.close();
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz