#include <iostream>
#include<algorithm>
using namespace std;
int main() {
// your code goes here
int n,y,z;
cin>>n;
int arr[n],sor[n];
int check=0,x[n];
int k=0;
while(cin>> arr[k])
{sor[k]=arr[k]; k++; }
if(n>2)
sort(sor,sor+n);
else if(n==2)
{
if(sor[0]>sor[1])
{
int temp= sor[0];
sor[0]=sor[1];
sor[1]=temp;
}
}
int j=0;
for(int i=0;i<n;i++)
{
if(sor[i]!=arr[i])
{check++; z=i;}
if(check==1&&arr[i]!=sor[i])
y=i;
}
if(check==0)
{cout<<"yes"<<endl; cout<<arr[0]<<" "<< arr[0];}
else
{ check=0;
for(int i=y;i<=z;i++)
{if(sor[z+y-i]==arr[i])
check++;
}
if(check==z-y+1)
{cout<<"yes"<<endl; cout<<sor[y]<<" "<< sor[z];}
else cout<<"no";
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZTxhbGdvcml0aG0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuLHksejsKCWNpbj4+bjsKCWludCBhcnJbbl0sc29yW25dOyAKCWludCBjaGVjaz0wLHhbbl07CmludAlrPTA7Cgl3aGlsZShjaW4+PiBhcnJba10pCgl7c29yW2tdPWFycltrXTsgaysrOyB9CgkKCQoJaWYobj4yKQoJc29ydChzb3Isc29yK24pOwoJZWxzZSBpZihuPT0yKQoJewoJCWlmKHNvclswXT5zb3JbMV0pCgkJewoJCQlpbnQgdGVtcD0gc29yWzBdOwoJCQlzb3JbMF09c29yWzFdOwoJCQlzb3JbMV09dGVtcDsKCQl9Cgl9CglpbnQgaj0wOwoJZm9yKGludCBpPTA7aTxuO2krKykKCXsgCgkgCgkJaWYoc29yW2ldIT1hcnJbaV0pCgkJe2NoZWNrKys7IHo9aTt9CgkJCgkKCWlmKGNoZWNrPT0xJiZhcnJbaV0hPXNvcltpXSkKCXk9aTsKICAgICB9CiAgICAgCiAgICAgCiAgICAgCiAgICAgaWYoY2hlY2s9PTApCiAgICB7Y291dDw8InllcyI8PGVuZGw7IGNvdXQ8PGFyclswXTw8IiAiPDwgYXJyWzBdO30gCiAgICAKICAgIGVsc2UKICAgIHsgY2hlY2s9MDsKICAgIGZvcihpbnQgaT15O2k8PXo7aSsrKQogICB7aWYoc29yW3oreS1pXT09YXJyW2ldKQogICAJY2hlY2srKzsKICAgfQogICAgaWYoY2hlY2s9PXoteSsxKQogICAgCXtjb3V0PDwieWVzIjw8ZW5kbDsgY291dDw8c29yW3ldPDwiICI8PCBzb3Jbel07fQogICAJZWxzZSBjb3V0PDwibm8iOwogICAgCQogICAgfQogICAgCiAgIAogICAgIAoKCQoJcmV0dXJuIDA7Cn0=