#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];

    auto calc=[](const array<int, 4> &arr) {
        array<array<int, 4>, 4> A;
        rep(i,4) {
            rep(j,4) {
                A[i][j] = arr[(i+j)%4];
            }
        }

        sort(all(A));

        ll hash = 0;
        ll k = 1;
        if (A[0]==A[1] and A[1]==A[2] and A[2]==A[3]) k = 4;
        else if (A[0]==A[1] and A[2]==A[3]) k = 2;
        ll b = 1;
        rep(i,4) {
            hash += A[0][i]*b;
            b *= 1000;
        }
        return pll(hash,k);
    };

    map<ll, ll> dic;
    rep(i,N) {
        auto[hash,k] = calc(C[i]);
        dic[hash]++;
    }

    array<array<int, 4>, 4> sokumen;
    vector<ll> D,kai,cnt;
    ll ans = 0;
    rep(i,N) {
        {
            auto[hash,k] = calc(C[i]);
            dic[hash]--;
        }

        rep(j,i) {
            {
                auto[hash,k] = calc(C[j]);
                dic[hash]--;
            }

            rep(k,4) { //底面の回転
                D.clear();
                kai.clear();
                cnt.clear();
                rep(l,4) {
                    sokumen[l][0] = C[i][3-l];
                    sokumen[l][1] = C[i][(6-l)%4];
                    sokumen[l][2] = C[j][(1+l+k)%4];
                    sokumen[l][3] = C[j][(l+k)%4];
                }

                rep(l,4) {
                    auto[hash,k] = calc(sokumen[l]);
                    bool same = false;
                    rep(x,SZ(D)) {
                        if (D[x]==hash) {
                            same = true;
                            cnt[x]++;
                            break;
                        }
                    }
                    if (!same) {
                        D.emplace_back(hash);
                        kai.emplace_back(k);
                        cnt.emplace_back(1);
                    }
                }

                ll val = 1;
                rep(x,SZ(D)) {
                    ll c = dic.count(D[x]) ? dic[D[x]] : 0;
                    rep(y,cnt[x]) {
                        val *= c;
                        c--;
                        val *= kai[x];
                    }
                }

                ans += val;
            }

            {
                auto[hash,k] = calc(C[j]);
                dic[hash]++;
            }
        }

        {
            auto[hash,k] = calc(C[i]);
            dic[hash]++;
        }
    }

    cout << ans/3 << ln;
}



Measured memory_bytes: 3632