#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c)                                                                \
    sort(All(c));                                                              \
    for(bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n)                                                             \
    vector<int> od(n);                                                         \
    iota(All(od), 0LL);

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    long long __VA_ARGS__;                                                     \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

// generic lambdas
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) &&                                                     \
    (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
    static inline constexpr decltype(auto)
    fix(F &&f) noexcept {
    return [f = std::forward<F>(f)](auto &&... args) {
        return f(f, std::forward<decltype(args)>(args)...);
    };
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const double PI = atan(1.0) * 4.0;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238

ll calchash(VL v) {
    ll mi = LINF;
    REP(loop, 4) {
        rotate(v.begin(), v.begin() + 1, v.end());
        mi = min(mi, v[3] + v[2] * 1000 + v[1] * 1000000 + v[0] * 1000000000);
    }
    return mi;
}

ll dfs(ll rem, ll n1, ll n2, ll n4) {
    ll ret = 0;
    if(rem == 0) return 1;
    if(n1) ret += n1 * dfs(rem - 1, n1 - 1, n2, n4);
    if(n2) ret += 2 * n2 * dfs(rem - 1, n1, n2 - 1, n4);
    if(n4) ret += 4 * n4 * dfs(rem - 1, n1, n2, n4 - 1);
    return ret;
}

signed main() {
    LCIN(N);
    map<ll, ll> memo[5];
    VVL x(N, VL(4));
    VL hs(N), rs(N);
    REP(i, N) {
        VECCIN(x[i]);
        ll h = calchash(x[i]);
        ll r = 1;
        if(x[i][0] == x[i][2] && x[i][1] == x[i][3]) {
            if(x[i][0] == x[i][1])
                r = 4;
            else
                r = 2;
        }
        hs[i] = h, rs[i] = r;
        memo[r][h]++;
    }
    ll ans = 0;
    REP(i, N) {
        memo[rs[i]][hs[i]]--;
        FOR(j, i + 1, N) {
            memo[rs[j]][hs[j]]--;
            REP(loop, 4) {
                map<ll, ll> cnt;
                cnt[calchash({x[i][1], x[i][0], x[j][1], x[j][0]})]++;
                cnt[calchash({x[i][2], x[i][1], x[j][0], x[j][3]})]++;
                cnt[calchash({x[i][3], x[i][2], x[j][3], x[j][2]})]++;
                cnt[calchash({x[i][0], x[i][3], x[j][2], x[j][1]})]++;
                ll tmp = 1;
                FOREACH(c, cnt) {
                    tmp *=
                        dfs(c.se, memo[1][c.fi], memo[2][c.fi], memo[4][c.fi]);
                    if(tmp == 0) break;
                }
                ans += tmp;
                rotate(x[j].begin(), x[j].begin() + 1, x[j].end());
            }
            memo[rs[j]][hs[j]]++;
        }
    }
    cout << ans << "\n";
}

Measured memory_bytes: 60160