CF1000247A

#include <algorithm>
#include <bitset>
#include <deque>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define fst first
#define snd second
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset(a, v, sizeof(a))
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define FORN(i,s,n) for(int i=s;i<(int)(n);i++)
#define FOR(i,n) FORN(i,0,n)
#define FORIT(i,x) for( typeof x.begin()  i=x.begin(); i!=x.end(); i++ )
#define trace(x)    cerr << #x << ": " << x << endl;
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl;

using namespace std;

typedef long long int64;
typedef vector <int> vi;
typedef pair <int,int> ii;
typedef vector <string> vs;
typedef vector <ii> vii;

const int INF = 2e9+9;

set <int> S1,S2,S3;

int main(){
    int N;
    cin>>N;
    vi A(3);
    vi T[N];
    FOR(i,N){
        scanf("%d %d %d", &A[0], &A[1], &A[2] );
        sort( all(A) );
        T[i]=A;
        S1.insert(A[0]);
        S2.insert(A[1]);
    }
    vi ans;
    FOR(i,N){
        int a=*(--S2.end());
        int b=*(--S1.end());
        if ( T[i][2]>=a and T[i][1]>=b ) ans.pb(i+1);
    }
    cout<<sz(ans)<<endl;
    FOR(i,sz(ans)) cout<<ans[i]<<" ";
    cout<<endl;
}