#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	#if 1
	int n; cin >> n;
	vector<vi> c(n, vi(4));
	rep(i, n) rep(j, 4) cin >> c[i][j];
	#else
	int n = 400;
	vector<vi> c(n, vi(4));
	//673205187207168000
	#endif
	ll ans = 0;
	map<vi, int> cnt;
	auto norm = [](const vi &v){
		vector<vi> u;
		rep(j, 4){
			u.pb({v[j], v[(j + 1) % 4], v[(j + 2) % 4], v[(j + 3) % 4]});
		}
		return *min_element(all(u));
	};
	auto count = [](const vi &v){
		vector<vi> u;
		rep(j, 4){
			u.pb({v[j], v[(j + 1) % 4], v[(j + 2) % 4], v[(j + 3) % 4]});
		}
		if(u[0] == u[1]) return 4;
		if(u[0] == u[2]) return 2;
		return 1;
	};
	rep(i, n) ++cnt[c[i] = norm(c[i])];
	
	
	rep(i, n){
		--cnt[c[i]];
		for(int j = i + 1; j < n; j++){
			--cnt[c[j]];
			rep(k, 4){
				const vi col = {c[i][0], c[i][1], c[i][2], c[i][3],
					c[j][(k + 3) % 4], c[j][(k + 2) % 4], c[j][(k + 1) % 4], c[j][k]};
				vector<vi> cs = {{0, 4, 5, 1}, {1, 5, 6, 2}, {3, 2, 6, 7}, {0, 3, 7, 4}};
				for(auto &v : cs){
					for(int &p : v) p = col[p];
					v = norm(v);
				}
				sort(all(cs));
				
				ll x = cnt.count(cs[0]) ? cnt[cs[0]] : 0;
				ll y = cnt.count(cs[1]) ? cnt[cs[1]] : 0;
				ll z = cnt.count(cs[2]) ? cnt[cs[2]] : 0;
				ll w = cnt.count(cs[3]) ? cnt[cs[3]] : 0;
				int rot = count(cs[0]) * count(cs[1]) * count(cs[2]) * count(cs[3]);
				/*
				if(x * y * z * w){
					dbg(i, j, k);
					dbg(x, y, z, w, rot);
					rep(ii, 4) dbg(ii, cs[ii]);
				}
				*/
				
				if(cs[0] == cs[3]){
					ans += x * (x - 1) * (x - 2) * (x - 3) * rot;
				}
				else if(cs[0] == cs[2]){
					ans += x * (x - 1) * (x - 2) * w * rot;
				}
				else if(cs[1] == cs[3]){
					ans += x * y * (y - 1) * (y - 2) * rot;
				}
				else if(cs[0] == cs[1] && cs[2] == cs[3]){
					ans += x * (x - 1) * z * (z - 1) * rot;
				}
				else if(cs[0] == cs[1]){
					ans += x * (x - 1) * z * w * rot;
				}
				else if(cs[1] == cs[2]){
					ans += x * y * (y - 1) * w * rot;
				}
				else if(cs[2] == cs[3]){
					ans += x * y * z * (z - 1) * rot;
				}
				else{
					ans += x * y * z * w * rot;
				}
			}
			++cnt[c[j]];
		}
	}
	cout << ans << endl;
	return 0;
}

Measured memory_bytes: 384