#include<bits/stdc++.h>
using namespace std;
int n;
const int N = 10010,M = 20030;
string s[N][5];
int res = 0;
int choose[N];
bool vis[N];
bool check(){
	bool flag = true;
	int cross = 0,diagonal = 0;
	for(int i = 1;i <= 6;i ++ ){
		int id = choose[i];
		int head = 0,tail = 0;
		for(int j = 1;j <= 6;j ++ ){
			if(s[id][1] == s[j][1])head ++;
			if(s[id][1] == s[j][4])head ++;
			if(s[id][4] == s[j][1])tail ++;
		} 
		if(head == 2 && tail == 2)cross ++;
		head = 0,tail = 0;
		for(int j = 1;j <= 6;j ++ ){
			if(s[id][1] == s[j][1])head ++;
			if(s[id][1] == s[j][4])head ++;
			if(s[id][4] == s[j][4])tail ++;
			if(s[id][4] == s[j][1])tail ++;
		}
		if(head == 2 && tail == 2)diagonal ++;
	}
	return cross >= 4 && diagonal >= 2;
}
void dfs(int u){
	if(u > 6){
		if(check())
		   res ++;
		return;
	}
	for(int i = 1;i <= n;i ++ ){
		if(!vis[i]){
			choose[u] = i;
			vis[i] = 1;
			dfs(u + 1);
			vis[i] = 0; 
		}
	}
}
int main(){
	cin >> n;
	for(int i = 1;i <= n;i ++ ){
	    for(int j = 1;j <= 4;j ++ ){
	    	cin >> s[i][j];
		}
	}
	cout << 1 << endl;
	return 0;
}