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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <cmath>
#include <numeric>
using namespace std;

namespace stanczyk {
	typedef int INT;
	typedef long long LL;
	typedef long double DOUBLE;

	const INT INF = 1000000001;
	constexpr const INT EPS_PRECISION = -9;
	const DOUBLE EPS = pow((DOUBLE)10.0, (DOUBLE)EPS_PRECISION);

	typedef vector<INT> VI;
}
using namespace stanczyk;



#define FOR(x, b, e) for (int x = b; x <= (e); ++x)
#define FORD(x, b, e) for (int x = b; x >= (e); --x)
#define REP(x, n) for (int x = 0; x<(n); ++x)
#ifdef _MSC_VER 
#define VAR(v, n) decltype(n) v = (n)
#else
#define VAR(v, n) __typeof(n) v = (n)
#endif
#define ALL(c) c.begin(), c.end()
#define SIZE(x) (int)x.size()
#define FOREACH(i, c) for (VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
#define PF push_front
#define MP make_pair

#include <string>

using namespace std;

int main()
{
	int n;
	scanf("%d", &n);
	int ones = 0;
	for (int i = 0;i < n;++i) {
		int x;
		scanf("%d", &x);
		if (x == 1) {
			ones++;
		}
	}

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

	return 0;

}