import java.util.Scanner;

class Main {
    public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);

	int N = sc.nextInt();
	int p[] = new int[N];
	for (int i = 0; i < N; i++)
	    p[i] = sc.nextInt();

	int count = 0;
	for (int i = 0; i < N - 1; i++) {
	    int key = i;
	    for (int j = i + 1; j < N; j++) {
		if (p[key] > p[j])
		    key = j;
	    }
	    
	    if (key != i) {
		int tmp = p[i];
		p[i] = p[key];
		p[key] = tmp;
		count++;
	    }
	}

	if (count < 2)
	    System.out.println("YES");
	else
	    System.out.println("NO");
    }
}
/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