#include<cstdio>
#include<cctype>
#include<iostream>
#include<fstream>
#include<functional>
#include<utility>
#include<vector>
#include<stack>
#include<map>
#include<queue>
#include<deque>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<set>
#include<complex>
#include<cstring>
#include<string>
#include<cassert>
#include<iomanip>


using namespace std;

typedef long long LL;

#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(n) (n).begin(), (n).end()
#define EPS 1e-9
#define INF 1e9
#define forn(i, n) for(int i = 0; i < (n); ++i)
#define forab(i, a, b) for(int i = a; (i) < (b); ++(i))
#define forba(i, b, a) for(int i = b-1; i >= (a); --i)
#define forit(i, v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)

int main(){
#ifdef FN
        freopen(FN".in", "r", stdin);
        freopen(FN".out", "w", stdout);
#endif
        int n, q;
        scanf("%d", &n);
        int s[101][2] = {{0,0}};
        forn(i, n){
                forn(j, n){
                        scanf("%d", &q);
                        s[i][0]+=q;
                        s[j][1]+=q;
                }
        }
        int k=0;
        forn(i, n){
                if(s[i][1]==0) ++k;
        }
        printf("%d", k);
        forn(i, n){
                if(s[i][1]==0)
                        printf(" %d", i+1);
        }   printf("\n");
        k = 0;
        forn(i, n){
                if(s[i][0]==0) ++k;
        }
        printf("%d", k);
        forn(i, n){
                if(s[i][0]==0)
                        printf(" %d", i+1);
        }   printf("\n");
        return 0;
}