/**
 *    author:  otera    
**/
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

void solve() {
	int n; cin >> n;
    vector<vector<int>> c(n, vector<int>(4));
    map<vector<int>, int> mp;
    rep(i, n) {
        rep(j, 4) {
            cin >> c[i][j];
        }
        rep(k, 4) {
            vector<int> d(4);
            rep(l, 4) {
                d[l] = c[i][(l + k) % 4];
            }
            mp[d] ++;
        }
    }
    int ans = 0;
    rep(i, n) {
        rep(k, 4) {
            vector<int> d(4);
            rep(l, 4) {
                d[l] = c[i][(l + k) % 4];
            }
            mp[d] --;
        }
        rep(j, n) {
            if(i == j) continue;
            rep(k, 4) {
                vector<int> d(4);
                rep(l, 4) {
                    d[l] = c[j][(l + k) % 4];
                }
                mp[d] --;
            }
            //
            rep(k, 4) {
                vector<int> d(4);
                rep(l, 4) {
                    d[l] = c[j][(l + k) % 4];
                }
                reverse(all(d));
                int res = 1;
                vector<vector<int>> X;
                rep(l, 4) {
                    // if(i == 0 && j == 4) cerr << res << endl;
                    vector<int> x = {c[i][(l + 1) % 4], c[i][l], d[l], d[(l + 1) % 4]};
                    // if(i == 0 && j == 4) {
                    //     cerr << c[i][l] << " " << c[i][(l + 1) % 4] << " " << d[(l + 1) % 4] << " " << d[l] << endl;
                    // }
                    if(mp[x] != 0) {
                        res *= mp[x];
                        X.push_back(x);
                        rep(m, 4) {
                            vector<int> e(4);
                            rep(o, 4) {
                                e[o] = x[(o + m) % 4];
                            }
                            mp[e] --;
                        }
                    } else {
                        res = 0;
                        break;
                    }
                }
                //if(i == 0 && j == 4) cerr << res << endl;
                for(auto x: X) {
                    rep(m, 4) {
                        vector<int> e(4);
                        rep(o, 4) {
                            e[o] = x[(o + m) % 4];
                        }
                        mp[e] ++;
                    }
                }
                //if(res) cerr << i << " " << j << " " << res << endl;
                ans += res;
            }
            //
            rep(k, 4) {
                vector<int> d(4);
                rep(l, 4) {
                    d[l] = c[j][(l + k) % 4];
                }
                mp[d] ++;
            }
        }
        rep(k, 4) {
            vector<int> d(4);
            rep(l, 4) {
                d[l] = c[i][(l + k) % 4];
            }
            mp[d] ++;
        }
    }
    cout << ans / 6 << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 80256