A - Lesha and array splitting

One spring day on his way to university Lesha found an array A. Lesha likes to split arrays into several parts. This time Lesha decided to split the arrayA into several, possibly one, new arrays so that the sum of elements in each of the new arrays is not zero. One more condition is that if we place the new arrays one after another they will form the old arrayA.

Lesha is tired now so he asked you to split the array. Help Lesha!

Input

The first line contains single integer n (1 ≤ n ≤ 100) — the number of elements in the arrayA.

The next line contains n integers a₁, a₂, ..., a_n ( - 10³ ≤ a_i ≤ 10³) — the elements of the array A.

Output

If it is not possible to split the array A and satisfy all the constraints, print single line containing "NO" (without quotes).

Otherwise in the first line print "YES" (without quotes). In the next line print single integerk — the number of new arrays. In each of the nextk lines print two integers l_i andr_i which denote the subarrayA[l_i...r_i] of the initial arrayA being the i-th new array. Integersl_i,r_i should satisfy the following conditions:

• l₁ = 1
• r_k = n
• r_i + 1 = l_i + 1 for each 1 ≤ i < k.

If there are multiple answers, print any of them.

Example

Input

3
1 2 -3

Output

YES
2
1 2
3 3

Input

8
9 -12 3 4 -4 -10 7 3

Output

YES
2
1 2
3 8

Input

1
0

Output

NO

Input

4
1 2 3 -5

Output

YES
4
1 1
2 2
3 3
4 4

我觉得这个题最难的部分应该是理解题意。

理解了其实很简单，一个数组先判断他的和是不是0；

如果不是零，直接输出整个数组就可以了；

如果是0，判断它是全为零，还是有非零元素；

全为零肯定不行输出NO；

不全为零就找到数组的第一个不为零的数，然后将它和它之前的数划为一个子数列，之后的划为另一个子数列；

代码如下：

#include
   
   
    
    
#include
    
    
     
     
int a[105];
 int main()
 {
 	int n;
 	while(~scanf("%d",&n))
 	{
 		memset(a,0,sizeof(a));
 		int flag=0,sum=0;
 		for(int i=1;i<=n;i++)
 		{
 			scanf("%d",&a[i]);
 			sum+=a[i];
 			if(a[i]!=0&&flag==0)
 			{
 				flag=i;
			 }
		 }
		 if(flag==0)
		 {
		 	printf("NO\n");
		 	continue;
		 }
		 if(sum!=0)
		 {
		 	printf("YES\n1\n");
		 	printf("1 %d\n",n);
		 }
		 else
		 {
		 	printf("YES\n2\n");
		 	printf("1 %d\n",flag);
		 	printf("%d %d\n",flag+1,n);
		 }
	}
 }