#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////


vi shift(vi vec, int c) { //shift in << this direction
	vi res(sz(vec));
	rep(i, 0, sz(vec)) {
		res[i] = vec[(i + c) % sz(vec)];
	}
	return res;
}

vi norm(vi vec) {
	vi res = vec;
	rep(i, 1, sz(vec)) {
		vi tmp = shift(vec, i);
		if(res > tmp) res = tmp;
	}
	return res;
}

ll mypow(int a, int b) {
	ll res = 1;
	while(b--) res *= a;
	return res;
}


ll P(int a, int b) { //assume a >= b
	if(a < b || a < 0 || b < 0) return 0;
	ll res = 1;
	rep(i, 0, b) {
		res *= a - i;
	}
	return res;
}

int N;
vi D[MAX_N];
map<vi, int> E;

void solve() {
	cin >> N;
	rep(i, 0, N) {
		rep(j, 0, 4) {
			int a; cin >> a;
			D[i].pb(a);
		}
		D[i] = norm(D[i]);
		E[D[i]]++;
	}
	ll ans = 0;
	rep(i, 0, N) {
		vi v1 = D[i];
		E[D[i]]--;
		rep(j, i + 1, N) {
			E[D[j]]--;
			rep(k, 0, 4) {
				vi v2 = shift(D[j], k);

				map<vi, int> M;
				rep(l, 0, 4) {
					int at1 = l, at2 = (l + 1) % 4;
					int bt1 = (4 - l) % 4, bt2 = (4 - l + 1) % 4;
					vi tmp(4);
					tmp[0] = v1[at2];
					tmp[1] = v1[at1];
					tmp[2] = v2[bt2];
					tmp[3] = v2[bt1];
					M[norm(tmp)]++;
				}
				ll tmp = 1;
				for(auto pp: M) {
					if(E.count(pp.fst)) tmp *= P(E[pp.fst], pp.sec);
					else tmp = 0;
					ll coef = 1;
					if(count(all(pp.fst), pp.fst[0]) == sz(pp.fst)) coef = 4;
					else if(pp.fst[0] == pp.fst[2] && pp.fst[1] == pp.fst[3]) coef = 2;
					tmp *= mypow(coef, pp.sec);
					// debug(i, j, k, v1, v2, tmp, pp.fst, coef, pp.sec, vector<pair<vi, int>>(all(E)));
				}
				ans += tmp;
			}
			E[D[j]]++;
		}
	}
	cout << ans << "\n";
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 12032