1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include <algorithm>
#include <cstdio>


const int MAX_N = 1000009;


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

    int a[MAX_N];
    for(int i = 0; i < n; ++i)
        scanf("%d", a + i);

    int counter = std::count(a, a + n, 1);

    if(counter >= 2)
        printf("0\n2\n1 2\n");
    else if(counter == 1)
        printf("1\n2\n1 2\n");
    else
        printf("2\n2\n1 2\n");
}