#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, g[110][110], ans, f[110], vis[110], cs[110], a[110];
void dfs(int x, int c, int id) {
	if(id == (1 << n) - 1) {
		ans = min(ans, c);
		f[c] ++;
		return ;
	}
	if(c >= ans || x > n + 1) {
		return ;
	}
	dfs(x + 1, c + 1, id | a[x]);
	dfs(x + 1, c, id);
}
void dfs2(int x, int c, int id) {
	if(c > ans || x > n + 1) {
		return ;
	}
	if(id == (1 << n) - 1) {
//		cout << 1;
		for(int i = 1; i <= ans; i ++) {
			cout << cs[i] << ' ';
		}
		cout << endl;
		return ;
	}
	cs[c + 1] = x;
	dfs2(x + 1, c + 1, id | a[x]);
	dfs2(x + 1, c, id);
}
signed main() {
	freopen("zpj.in", "r", stdin);
	freopen("zpj.out", "w", stdout);
	cin >> n;
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= n; j ++) {
			cin >> g[i][j];
		}
		g[i][i] = 1;
	}
	for(int i = 1; i <= n; i ++) {
		for(int j = 1; j <= n; j ++) {
			a[i] = a[i] * 2 + g[i][j];
		}
//		cout << a[i] << ' ';
	}
	ans = 1000001;
	dfs(1, 0, 0);
	cout << ans << endl;
	cout << f[ans] << endl;
	dfs2(1, 0, 0);
    return 0;
}