#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	vector dp(2, vector<bool>(n + 1));
	rep(_, 2) {
		set<int>st;
		dp[0][0] = true;
		rep(i, n) {
			if (!dp[0][i]) {
				dp[0][i + 1] = false;
				continue;
			}
			dp[0][i + 1] = !st.count(a[i]);
			st.insert(a[i]);
		}
		swap(dp[0], dp[1]);
		reverse(all(a));
	}
	reverse(all(dp[1]));
	rep(i, 2) {
		rep(j, n + 1) {
			cout << dp[i][j];
		}
		cout << endl;
	}
	vector<int>ans;
	rep2(i, 1, n)if (dp[0][i] && dp[1][i])ans.push_back(i);
	cout << ans.size() << endl;
	rep(i, ans.size())cout << ans[i] << " ";
	cout << endl;
	return 0;
}