#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;

const int maxn = 1000005;

int t[maxn];

int n, sum;

int main()
{
    scanf("%d", &n);

    for(int i = 1; i <= n; i++)
    {
        scanf("%d", &t[i]);
        sum += t[i];
    }

    if( sum != 0 )
    {
        printf("YES\n1\n1 %d", n);
        return 0;
    }

    int it = 1;
    while( t[it] == 0 )
    {
        it ++;
    }

    if( it > n )
    {
        printf("NO");
        return 0;
    }

    if( it == n )
    {
        printf("YES\n1\n1 %d", n);
        return 0;
    }

    /*int poz = it + 1;
    while( t[poz] == 0 )
    {
        poz ++;
    }

    if( poz > n )
    {
        printf()
    }*/

    printf("YES\n2\n1 %d\n%d %d", it, it + 1, n);
}