// Copyright (C) 2017 __debug.

// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; version 3

// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License
// along with this program; If not, see <http://www.gnu.org/licenses/>.


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>

#define x first
#define y second
#define MP std::make_pair
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#ifdef __linux__
#define getchar getchar_unlocked
#define putchar putchar_unlocked
#endif

using std::pair;
using std::vector;
using std::string;

typedef long long LL;
typedef pair<int, int> Pii;

const int oo = 0x3f3f3f3f;

template<typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, true : false; }
template<typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, true : false; }
string procStatus()
{
    std::ifstream t("/proc/self/status");
    return string(std::istreambuf_iterator<char>(t), std::istreambuf_iterator<char>());
}
template<typename T> T read(T &x)
{
    int f = 1;
    char ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        f = (ch == '-' ? -1 : 1);
    for (x = 0; isdigit(ch); ch = getchar())
        x = 10 * x + ch - '0';
    return x *= f;
}
template<typename T> void write(T x)
{
    if (x == 0) {
        putchar('0');
        return;
    }
    if (x < 0) {
        putchar('-');
        x = -x;
    }
    static char s[20];
    int top = 0;
    for (; x; x /= 10)
        s[++top] = x % 10 + '0';
    while (top)
        putchar(s[top--]);
}
// EOT

const int MAXN = 405;

typedef pair<Pii, Pii> Surface;

int N;
Surface A[MAXN];

void input()
{
    read(N);
    for (int i = 1; i <= N; ++i) {
        read(A[i].x.x); read(A[i].x.y);
        read(A[i].y.y); read(A[i].y.x);
    }
}

std::map<Surface, int> cnt;

inline Surface R(const Surface &s)
{
    return MP(MP(s.x.y, s.y.y), MP(s.x.x, s.y.x));
}

inline void contrib(const Surface &s, int f)
{
    cnt[s] += f;
    cnt[R(s)] += f;
    cnt[R(R(s))] += f;
    cnt[R(R(R(s)))] += f;
}

void solve()
{
    LL ans = 0;

    for (int i = N; i >= 1; --i) {
        Surface si = A[i];
        for (int j = i + 1; j <= N; ++j) {
            Surface sj = A[j];
            contrib(sj, -1);
            for (int k = 0; k < 4; ++k) {
                Surface l = MP(MP(sj.x.y, si.x.x), MP(sj.y.y, si.y.x));
                Surface r = MP(MP(si.x.y, sj.x.x), MP(si.y.y, sj.y.x));
                Surface u = MP(MP(sj.x.y, sj.x.x), MP(si.x.x, si.x.y));
                Surface d = MP(MP(si.y.x, si.y.y), MP(sj.y.y, sj.y.x));
                if (cnt.count(l) && cnt.count(r) && cnt.count(u) && cnt.count(d)) {
                    LL cur = 1;
                    cur *= cnt[l]; contrib(l, -1);
                    cur *= cnt[r]; contrib(r, -1);
                    cur *= cnt[u]; contrib(u, -1);
                    cur *= cnt[d]; contrib(d, -1);
                    ans += cur;
                    contrib(l, +1);
                    contrib(r, +1);
                    contrib(u, +1);
                    contrib(d, +1);
                }
                sj = R(sj);
            }
            contrib(sj, +1);
        }
        contrib(si, +1);
    }

    printf("%lld\n", ans);
}

int main()
{
#ifdef __DEBUG
    freopen("E.in", "r", stdin);
    freopen("E.out", "w", stdout);
#endif

    input();
    solve();
}

// 我们称那位衣着暴露的S小姐为”局部真理”，因为真理都是赤裸裸的。
//   --钱钟书


Measured memory_bytes: 384