//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")

#include <bits/stdc++.h>

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef KIVI
#define DEBUG for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl

template<class ...Ts>
auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }

#else
#define DEBUG while (false)
#define LOG(...)
#endif

mt19937 rng(4242);

const int max_n = 1e5 + 42, inf = 1000111222;

struct dsu {
    int p_or_sz[max_n];

    void init(int n) {
        for (int i = 0; i < n; ++i) {
            p_or_sz[i] = -1;
        }
    }

    int find_set(int v) {
        if (p_or_sz[v] < 0) {
            return v;
        }
        return p_or_sz[v] = find_set(p_or_sz[v]);
    }

    bool union_set(int v1, int v2) {
        v1 = find_set(v1);
        v2 = find_set(v2);
        if (v1 == v2) {
            return false;
        }
        if (-p_or_sz[v1] > -p_or_sz[v2]) {
            swap(v1, v2);
        }
        p_or_sz[v2] += p_or_sz[v1];
        p_or_sz[v1] = v2;
        return true;
    }
};

void solve() {
    int k;
    cin >> k;
    vector<array<int, 6> > av(k);
    for(int i = 0; i < k; i++) {
        for(int j = 0; j < 6; j++) cin >> av[i][j];
    }
    vector<array<int, 3> > tri;
    vector<array<int, 2> > dva;
    for(int i = 0; i < k; i++) {
        tri.pb({av[i][0], av[i][1], av[i][2]});
        tri.pb({av[i][3], av[i][4], av[i][5]});
        dva.pb({av[i][0], av[i][1]});
        dva.pb({av[i][3], av[i][4]});
    }
    sort(all(tri));
    tri.resize(unique(all(tri)) - tri.begin());
    sort(all(dva));
    dva.resize(unique(all(dva)) - dva.begin());
    dsu DSU_tri, DSU_dva;
    int n = max(len(tri), len(dva));
    DSU_tri.init(n);
    DSU_dva.init(n);
    bool tri_cycle = false, dva_cycle = false;
    set<pair<int, int> > tri_edges, dva_edges;
    for(auto& x : av) {
        int a_tri = lower_bound(all(tri), array<int, 3>{x[0], x[1], x[2]}) - tri.begin();
        int b_tri = lower_bound(all(tri), array<int, 3>{x[3], x[4], x[5]}) - tri.begin();
        int a_dva = lower_bound(all(dva), array<int, 2>{x[0], x[1]}) - dva.begin();
        int b_dva = lower_bound(all(dva), array<int, 2>{x[3], x[4]}) - dva.begin();
        if(a_tri > b_tri) swap(a_tri, b_tri);
        if(a_dva > b_dva) swap(a_dva, b_dva);
        if(a_tri != b_tri && !tri_edges.count({a_tri, b_tri})) {
            tri_cycle |= !DSU_tri.union_set(a_tri, b_tri);
            tri_edges.insert({a_tri, b_tri});
        }
        if(a_dva != b_dva && !dva_edges.count({a_dva, b_dva})) {
            dva_cycle |= !DSU_dva.union_set(a_dva, b_dva);
            dva_edges.insert({a_dva, b_dva});
        }
    }
    if(tri_cycle) cout << "True closed chains";
    else cout << "No true closed chains";
    cout << '\n';
    if(dva_cycle) cout << "Floor closed chains";
    else cout << "No floor closed chains";
}

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;

//    cin >> t;

    while (t--) solve();

}

/*
KIVI
*/