#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

int main() {
    int N; cin >> N;
    vector<array<int, 4>> C(N);
    rep(i,N) rep(j,4) cin >> C[i][j];

    array<int, 4> A,B,E;
    vector<array<int, 4>> D;
    vector<int> uni,cnt,kai;
    ll ans = 0;
    rep(i,N) {
        rep(k,4) A[k] = C[i][k];
        rep(j,i) {
            rep(_,4) {//下の面の回転
                D.clear();
                uni.clear();
                cnt.clear();
                kai.clear();
                rep(l,4) B[l] = C[j][(l+_)%4];

                rep(l,4) {
                    E[0] = A[3-l];
                    E[1] = A[(6-l)%4];
                    E[2] = B[(1+l)%4];
                    E[3] = B[l];
                    bool same = false;
                    rep(w,SZ(D)) {
                        rep(y,4) {
                            bool same2 = true;
                            rep(x,4) {
                                if (D[w][x] != E[(x+y)%4]) same2 = false;
                            }
                            if (same2) {
                                same = true;
                                uni[w]++;
                                break;
                            }
                        }
                        if (same) break;
                    }
                    if (!same) {
                        D.emplace_back(E);
                        uni.emplace_back(1);
                        cnt.emplace_back(0);
                        kai.emplace_back(1);
                    }
                }

                rep(w,SZ(D)) {
                    if (D[w][0]==D[w][1] and D[w][1]==D[w][2] and D[w][2]==D[w][3]) kai[w] = 4;
                    else if (D[w][0]==D[w][2] and D[w][1]==D[w][3]) kai[w] = 2;
                }

                rep(k,N) {
                    if (k==i or k==j) continue;
                    rep(w,SZ(D)) {
                        bool same2 = false;
                        rep(x,4) {
                            bool same = true;
                            rep(y,4) {
                                if (D[w][y]!=C[k][(x+y)%4]) same = false;
                            }
                            if (same) {
                                cnt[w]++;
                                if (same) same2 = true; 
                                break;
                            } 
                        }
                        if (same2) break;
                    } 
                }

                ll val = 1;
                rep(w,SZ(D)) {
                    ll c = cnt[w];
                    rep(x,uni[w]) {
                        val *= c;
                        c--;
                        val *= kai[w];
                    }
                }

                ans += val;
            }
        }
    }

    cout << ans/3 << ln;
}



Measured memory_bytes: 3628