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
26
27
28
29
30
#include<iostream>
#include<algorithm>
using namespace std;

int tab[1000001],n;

int main()
{
    cin>>n;

    for(int i=0; i<n; i++)
    {
        cin>>tab[i];
    }

    sort(tab, tab+n);

    if(tab[0]==1 && tab[1]==1)
    {
        cout<<0<<"\n";
    }else if(tab[0]==1 || tab[1]==1){
        cout<<1<<"\n";
    }else{
        cout<<2<<"\n";
    }

    cout<<2<<"\n"<<1<<" "<<2;

    return 0;
}