#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second
 
int n;
 
struct subset {
    vector<bool> inout;
    subset() {
        inout.assign(1 + n, false);
    }
    bool operator < (const subset & other) const {
        return inout < other.inout;
    }
};
 
subset DEF;
 
struct ansrow {
    int b;
    int t[2];
};
 
int k;
vector<int> a;
vector<vector<int> > s;
map<subset, int> sbs; // subsets
vector<ansrow> ans;
 
subset step(subset nodes, bool bit) {
    subset res = DEF;
    for(int i = 1; i <= n; i++) {
        if(nodes.inout[i]) {
            res.inout[s[i][bit]] = true;
        }
    }
    return res;
}
 
pair<bool, int> create_for(subset nodes) {
    int partialresult = sbs[nodes];
    /*cout << "???: ";
    for(int i = 1; i <= n; i++) {
        cout << nodes.inout[i];
    }
    cout << "\n";*/
    if(partialresult) {
        return mp(false, partialresult);
    }
    int idx = ans.size();
    sbs[nodes] = idx;
    ans.pb(ansrow());
    return mp(true, idx);
}
 
void solve_for(subset nodes, int idx) {
    vector<bool> has(2, false);
    for(int i = 1; i <= n; i++) {
        if(nodes.inout[i]) {
            has[a[i]] = true;
        }
    }
    if(!has[0] && !has[1]) {
        exit(1);
    }
    if(has[0] && has[1]) {
        bool which = false;
        subset with_0 = DEF;
        subset with_1 = DEF;
        for(int i = 1; i <= n; i++) {
            if(nodes.inout[i]) {
                if(a[i] == 0) {
                    with_0.inout[i] = true;
                } else if(a[i] == 1) {
                    with_1.inout[i] = true;
                }
            }
        }
        //cout << idx << " " << with_0.inout[1] << with_0.inout[2] << with_1.inout[1] << with_1.inout[2] << "!!!\n";
        ans[idx].b = which;
        subset nw0 = step(with_0, which);
        pair<bool, int> res0 = create_for(nw0);
        //cout << "res: " << res0.fi << " " << res0.se << "\n";
        ans[idx].t[false] = res0.se;
        if(res0.fi) {
            solve_for(nw0, res0.se);
        }
        subset nw1 = step(with_1, which);
        pair<bool, int> res1 = create_for(nw1);
        ans[idx].t[true] = res1.se;
        if(res1.fi) {
            solve_for(nw1, res1.se);
        }
    } else {
        bool which = has[1];
        subset nw = step(nodes, which);
        pair<bool, int> res = create_for(nw);
        ans[idx] = {which, res.se, res.se};
        if(res.fi) {
            solve_for(nw, res.se);
        }
    }
}
 
void solve() {
    cin >> n;
    DEF.inout.assign(1 + n, false);
    a.assign(1 + n, 0);
    s.assign(1 + n, vector<int> (2, 0));
    for(int i = 1; i <= n; i++) {
        cin >> a[i] >> s[i][0] >> s[i][1];
    }
    cin >> k;
    subset all = DEF;
    for(int i = 1; i <= n; i++) {
        all.inout[i] = true;
    }
    //cout << all.inout.size() << "\n";
    ans.resize(1);
    create_for(all);
    solve_for(all, 1);
    cout << (ans.size() - 1) << " " << 1 << "\n";
    for(int i = 1; i < ans.size(); i++) {
        cout << ans[i].b << " " << ans[i].t[0] << " " << ans[i].t[1] << "\n";
    }
}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}