// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max()/2-1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
// <<<

int32_t main() {
    int n; cin >> n;
    auto c = make_v<int,2>(n,4); cin >> c;

    auto rot = [&](vector<int> &cc) {
        rotate(cc.begin(), cc.begin()+1, cc.end());
    };
    auto id = [](vector<int> const& cc) {
        assert(sz(cc) == 4);
        int sum = 0, p = 1;
        rep (i,4) sum += p*cc[i], p *= 1000;
        return sum;
    };
    auto num = [&](vector<int> const& cc) {
        auto dd = cc;
        rot(dd);
        if (cc == dd) return 4;
        rot(dd);
        if (cc == dd) return 2;
        return 1;
    };
    unordered_map<int,int> cnt1,cnt2,cnt4;
    rep (i,n) rep (k,4) {
        int x = num(c[i]);
        if (x == 1) cnt1[id(c[i])]++;
        if (x == 2) cnt2[id(c[i])]++;
        if (x == 4) cnt4[id(c[i])]++;
        rot(c[i]);
    }

    auto equiv = [&](vector<int> &c1, vector<int> &c2) -> bool {
        rep (k,4) {
            if (c1 == c2) return true;
            rot(c2);
        }
        return false;
    };

    int ans = 0;
    rep (i,n) rep (j,n) if (i < j) {
        rep (k,4) {
            vector<vector<int>> a(4);
            rep (x,4) {
                a[x] = {c[i][(x+1)%4],c[i][x],
                        c[j][(k-x+4)%4],c[j][(k-x-1+4)%4]};
            }
            vector<int> m0(4),m1(4);
            rep (x,4) {
                rep (k,4) {
                    if (a[x] == c[i]) m0[x]++;
                    rot(c[i]);
                }
                rep (k,4) {
                    if (a[x] == c[j]) m1[x]++;
                    rot(c[j]);
                }
            }

            vector<int> cc1(4),cc2(4),cc4(4);
            rep (x,4) cc1[x] = cnt1[id(a[x])];
            rep (x,4) cc2[x] = cnt2[id(a[x])];
            rep (x,4) cc4[x] = cnt4[id(a[x])];

            auto f = [&](vector<int> const& v) -> int {
                int c1 = cc1[v[0]], c2 = cc2[v[0]], c4 = cc4[v[0]];
                if (sz(v) == 1) {
                    int ret = 0;
                    ret += c1 + c2 + c4;
                    ret -= m0[v[0]];
                    ret -= m1[v[0]];
                    return ret;
                }
                if (sz(v) == 2) {
                    int ret = 0;
                    if (equiv(a[v[0]], a[v[1]])) {
                        ret += c1 + c2*2 + c4*4;
                    }
                    ret -= m0[v[0]]*m0[v[1]];
                    ret -= m1[v[0]]*m1[v[1]];
                    return ret;
                }
                if (sz(v) == 3) {
                    int ret = 0;
                    if (equiv(a[v[0]], a[v[1]]) &&
                        equiv(a[v[0]], a[v[2]])) {
                        ret += c1 + c2*2*2 + c4*4*4;
                    }
                    ret -= m0[v[0]]*m0[v[1]]*m0[v[2]];
                    ret -= m1[v[0]]*m1[v[1]]*m1[v[2]];
                    return ret;
                }
                if (sz(v) == 4) {
                    int ret = 0;
                    if (equiv(a[v[0]], a[v[1]]) &&
                        equiv(a[v[0]], a[v[2]]) &&
                        equiv(a[v[0]], a[v[3]])) {
                        ret += c1 + c2*2*2*2 + c4*4*4*4;
                    }
                    ret -= m0[v[0]]*m0[v[1]]*m0[v[2]]*m0[v[3]];
                    ret -= m1[v[0]]*m1[v[1]]*m1[v[2]]*m1[v[3]];
                    return ret;
                }
                return -1;
            };
            int c0 = f({0}), c1 = f({1}), c2 = f({2}), c3 = f({3});
            int c01 = f({0,1}), c02 = f({0,2}), c03 = f({0,3}),
                c12 = f({1,2}), c13 = f({1,3}), c23 = f({2,3});
            int c012 = f({0,1,2}), c013 = f({0,1,3}), c023 = f({0,2,3}),
                c123 = f({1,2,3});
            int c0123 = f({0,1,2,3});

            int tmp = 0;
            tmp += c0 * c1 * c2 * c3;
            tmp += -1 * ( c01*c2*c3 + c02*c1*c3 + c03*c1*c2
                         + c12*c0*c3 + c13*c0*c2 + c23*c0*c1 );
            tmp += +2 * ( c012*c3 + c013*c2 + c023*c1 + c123*c0 )
                + ( c01*c23 + c02*c13 + c03*c12 );
            tmp += -6 * ( c0123 );

            ans += tmp;
        }
    }
    dump(ans);
    assert(ans % 3 == 0);
    cout << ans/3 << endl;


}


Measured memory_bytes: 170352