import java.io.PrintStream;
import java.util.Scanner;

public class Main {
	static final PrintStream out = System.out;
	static Scanner sc = new Scanner(System.in);
	static final long Mod = 1000_000_007L;
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		System.exit(0);
	}

	void solve() {
		int N = nextInt();
		int[] A = nextIntArray(N);

		int t1 = -1,t2 = -1;
		for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		}
		if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		}
		for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	}

	public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	}
	public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	}
	public int nextInt() {
		return Integer.parseInt(next());
	}
	public long nextLong() {
		return Long.parseLong(next());
	}
	public String next() {
		return sc.next();
	}


} import java.io.PrintStream; PrintStream java.io import java.util.Scanner; Scanner java.util public class Main {
	static final PrintStream out = System.out;
	static Scanner sc = new Scanner(System.in);
	static final long Mod = 1000_000_007L;
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		System.exit(0);
	}

	void solve() {
		int N = nextInt();
		int[] A = nextIntArray(N);

		int t1 = -1,t2 = -1;
		for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		}
		if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		}
		for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	}

	public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	}
	public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	}
	public int nextInt() {
		return Integer.parseInt(next());
	}
	public long nextLong() {
		return Long.parseLong(next());
	}
	public String next() {
		return sc.next();
	}


} Main static final PrintStream out = System.out; out System.out System System.out static Scanner sc = new Scanner(System.in); sc new Scanner(System.in) static final long Mod = 1000_000_007L; Mod 1000_000_007L public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		System.exit(0);
	} main {
		Main main = new Main();
		main.solve();
		System.exit(0);
	} Main main = new Main(); main new Main() main.solve() main.solve main System.exit(0) System.exit System 0 String[] args args void solve() {
		int N = nextInt();
		int[] A = nextIntArray(N);

		int t1 = -1,t2 = -1;
		for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		}
		if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		}
		for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	} solve {
		int N = nextInt();
		int[] A = nextIntArray(N);

		int t1 = -1,t2 = -1;
		for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		}
		if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		}
		for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	} int N = nextInt(); N nextInt() nextInt int[] A = nextIntArray(N); A nextIntArray(N) nextIntArray N int t1 = -1 t1 -1 1 t2 = -1; t2 -1 1 for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		} int i=0; int i=0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		} {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		} if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			} A[i] > A[i+1] A[i] A i A[i+1] A i+1 i 1 {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			} t1 = i t1 i for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				} int j=i+1; int j=i+1; j i+1 i 1 j<N-1 j N-1 N 1 j++ j++ j {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				} {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				} if(A[j] > A[j+1]) {
						t2 = j+1;
					} A[j] > A[j+1] A[j] A j A[j+1] A j+1 j 1 {
						t2 = j+1;
					} t2 = j+1 t2 j+1 j 1 break; if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		} t1 != -1&&t2 != -1 t1 != -1 t1 -1 1 t2 != -1 t2 -1 1 {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		} int tmp = A[t1]; tmp A[t1] A t1 A[t1] = A[t2] A[t1] A t1 A[t2] A t2 A[t2] = tmp A[t2] A t2 tmp for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		} int i=0; int i=0; i 0 i<N-1 i N-1 N 1 i++ i++ i {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		} {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		} if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			} A[i]>A[i+1] A[i] A i A[i+1] A i+1 i 1 {
				out.println("NO");
				return;
			} out.println("NO") out.println out "NO" return; out.println("YES") out.println out "YES" public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	} nextIntArray {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	} int[] a = new int[n]; a new int[n] n for (int i = 0; i < n; i++)a[i] = nextInt(); int i = 0; int i = 0; i 0 i < n i n i++ i++ i a[i] = nextInt(); a[i] = nextInt() a[i] a i nextInt() nextInt return a; a int n n public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	} nextLongArray {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	} long[] a = new long[n]; a new long[n] n for (int i = 0; i < n; i++)a[i] = nextLong(); int i = 0; int i = 0; i 0 i < n i n i++ i++ i a[i] = nextLong(); a[i] = nextLong() a[i] a i nextLong() nextLong return a; a int n n 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 long nextLong() {
		return Long.parseLong(next());
	} nextLong {
		return Long.parseLong(next());
	} return Long.parseLong(next()); Long.parseLong(next()) Long.parseLong Long next() next public String next() {
		return sc.next();
	} next {
		return sc.next();
	} return sc.next(); sc.next() sc.next sc public class Main {
	static final PrintStream out = System.out;
	static Scanner sc = new Scanner(System.in);
	static final long Mod = 1000_000_007L;
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		System.exit(0);
	}

	void solve() {
		int N = nextInt();
		int[] A = nextIntArray(N);

		int t1 = -1,t2 = -1;
		for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		}
		if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		}
		for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	}

	public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	}
	public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	}
	public int nextInt() {
		return Integer.parseInt(next());
	}
	public long nextLong() {
		return Long.parseLong(next());
	}
	public String next() {
		return sc.next();
	}


} public class Main {
	static final PrintStream out = System.out;
	static Scanner sc = new Scanner(System.in);
	static final long Mod = 1000_000_007L;
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		System.exit(0);
	}

	void solve() {
		int N = nextInt();
		int[] A = nextIntArray(N);

		int t1 = -1,t2 = -1;
		for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		}
		if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		}
		for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	}

	public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	}
	public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	}
	public int nextInt() {
		return Integer.parseInt(next());
	}
	public long nextLong() {
		return Long.parseLong(next());
	}
	public String next() {
		return sc.next();
	}


} Main
import java.io.PrintStream;
import java.util.Scanner;

public class Main {
	static final PrintStream out = System.out;
	static Scanner sc = new Scanner(System.in);
	static final long Mod = 1000_000_007L;
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		System.exit(0);
	}

	void solve() {
		int N = nextInt();
		int[] A = nextIntArray(N);

		int t1 = -1,t2 = -1;
		for(int i=0;i<N-1;i++) {
			if(A[i] > A[i+1]) {
				t1 = i;
				for(int j=i+1;j<N-1;j++) {
					if(A[j] > A[j+1]) {
						t2 = j+1;
					}
				}
				break;
			}
		}
		if(t1 != -1&&t2 != -1) {
			int tmp = A[t1];
			A[t1] = A[t2];
			A[t2] = tmp;
		}
		for(int i=0;i<N-1;i++) {
			if(A[i]>A[i+1]) {
				out.println("NO");
				return;
			}
		}
		out.println("YES");
	}

	public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	}
	public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	}
	public int nextInt() {
		return Integer.parseInt(next());
	}
	public long nextLong() {
		return Long.parseLong(next());
	}
	public String next() {
		return sc.next();
	}


}