GroupBlog

Being a programmer, you like arrays a lot. For your birthday, your friends have given you an array a consisting of n distinct integers.

Unfortunately, the size of a is too small. You want a bigger array! Your friends agree to give you a bigger array, but only if you are able to answer the following question correctly: is it possible to sort the array a (in increasing order) by reversing exactly one segment of a? See definitions of segment and reversing in the notes.

Input

The first line of the input contains an integer n (1 ≤ n ≤ 10⁵) — the size of array a.

The second line contains n distinct space-separated integers: a[1], a[2], ..., a[n] (1 ≤ a[i] ≤ 10⁹).

Output

Print "yes" or "no" (without quotes), depending on the answer.

If your answer is "yes", then also print two space-separated integers denoting start and end (start must not be greater than end) indices of the segment to be reversed. If there are multiple ways of selecting these indices, print any of them.

Example

Input

3
3 2 1

Output

yes
1 3

Input

4
2 1 3 4

Output

yes
1 2

Input

4
3 1 2 4

Output

no

Input

2
1 2

Output

yes
1 1

Note

Sample 1. You can reverse the entire array to get [1, 2, 3], which is sorted.

Sample 3. No segment can be reversed such that the array will be sorted.

Definitions

A segment [l, r] of array a is the sequence a[l], a[l + 1], ..., a[r].

If you have an array a of size n and you reverse its segment [l, r], the array will become:

a[1], a[2], ..., a[l - 2], a[l - 1], a[r], a[r - 1], ..., a[l + 1], a[l], a[r + 1], a[r + 2], ..., a[n - 1], a[n].

先进行排序，然后进行模拟就好了

#include <iostream> 
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <queue>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
const int maxn=5e2+10;
const int INF = 1e9;
using namespace std;
typedef  long long ll;
typedef  unsigned long long  ull; 
const int N = 1e6+5;

typedef struct node{
	ll val;
	ll index;
}NODE;

NODE a[100005];
NODE b[100005];
int flag[100005];
ll n; 
int cmp(NODE x,NODE y)
{
	return x.val<y.val;
}

int main()
{
	ios::sync_with_stdio(false);  
	cin >>n;
	for(int i=1;i<=n;i++)
	{
		cin  >> a[i].val;
		a[i].index = i;	
		b[i] = a[i];
		
	}
	ll l=0,r=0,ct= 0 ;
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++)
	{
		if(a[i].val!=b[i].val)
		{
			flag[i]=1;
			ct ++; 
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(flag[i]==1)
		{
			l = i;
			break;
		}	
	}
	
	if(l==0)
	{
		cout << "yes"<<endl<<" 1 1 "<<endl;
		return 0;
	 } 
	for(int i=n;i>=l;i--)
	{
		if(flag[i]==1)
		{
			r = i;
			break;
		} 
	}
	
	//cout <<r<<l<<endl; 
	/*if(r-l+1!=ct)
	{	
		cout <<"no"<<endl;
		return 0;
	}*/
	
	for(int i=l,j=r;i<=j;i++,j--)
	{
		if(a[i].val!=b[j].val)
		{
			cout <<"no"<<endl;
			return 0;
		}
	}
	for(int i=l,j=r;i<=j;i++,j--)
	{
		if(b[i].val!=a[j].val)
		{
			cout <<"no"<<endl;
			return 0;
		}
	}
	
	
	cout << "yes"<<endl<<l<<" "<<r<<endl;
	
	return 0;	
}