#include<iostream>#include<cmath>#include<cstring>#include<cstdio>#include<algorithm>usingnamespacestd;
constint maxn=100005;
int a[maxn],n,b[maxn],i,t,j,k,l;
int main(){
scanf("%d",&n);
for (i=1;i<=n;i++)
scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+n+1);
for (i=1;i<=n;i++)
if (b[i]!=a[i]) t++;
if (t<=2) printf("YES\n");
elseprintf("NO\n");
}