#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 100'447;
bool used[2][N];
set<int> g[2][N];

bool dfs(int t, int v, int p)
{
	//cerr << t << ' ' << v << ' ' << p << '\n';
	bool cycle = false;
	used[t][v] = 1;
	for (auto to : g[t][v])
	{
		if (to == p || to == v) 
			continue;
		if (used[t][to])
			return true;
		cycle |= dfs(t, to, v);
	}
	return cycle;
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n;
	cin >> n;
	map<tuple<int, int, int>, int> m1;
	map<PII, int> m2;
	FOR (i, 0, n)
	{
		int x1, y1, z1, x2, y2, z2;
		cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
		if (!m1.count({x1, y1, z1}))
			m1[{x1, y1, z1}] = SZ(m1);
		if (!m1.count({x2, y2, z2}))
			m1[{x2, y2, z2}] = SZ(m1);
		if (!m2.count({x1, y1}))
			m2[{x1, y1}] = SZ(m2);
		if (!m2.count({x2, y2}))
			m2[{x2, y2}] = SZ(m2);
		int v1 = m1[{x1, y1, z1}];
		int v2 = m1[{x2, y2, z2}];
		g[0][v1].insert(v2);
		g[0][v2].insert(v1);
		v1 = m2[{x1, y1}];
		v2 = m2[{x2, y2}];
		g[1][v1].insert(v2);
		g[1][v2].insert(v1);
	}
	bool ans1 = false;
	bool ans2 = false;
	FOR (i, 0, SZ(m1))
	{
		if (!used[0][i])
			ans1 |= dfs(0, i, -1);
	}
	FOR (i, 0, SZ(m2))
	{
		if (!used[1][i])
		{
			ans2 |= dfs(1, i, -1);
		}
	}
	
	if (ans1)
		cout << "True closed chains\n";
	else
		cout << "No true closed chains\n";
	
	if (ans2)
		cout << "Floor closed chains\n";
	else
		cout << "No floor closed chains\n";
	
	return 0;
	
}