#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i,a,b) for(ll i=a;i<=b;++i)
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep3(i,a,b) for(ll i=a;i>=b;i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define vec vector<int>
#define vecll vector<ll>
#define vecpii vector<pii>
#define vecpll vector<pll>
#define vec2(a,b) vector<vec>(a,vec(b))
#define vec2ll(a,b) vector<vecll>(a,vecll(b))
#define vec3(a,b,c) vector<vector<vec>>(a,vec2(b,c))
#define vec3ll(a,b,c) vector<vector<vecll>>(a,vec2ll(b,c))
#define fi first
#define se second
#define all(c) begin(c),end(c)
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),(x)))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),(x)))
using namespace std;
int in() {int x;cin>>x;return x;}
ll lin() {unsigned long long x;cin>>x;return x;}
string stin() {string s;cin>>s;return s;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
vec iota(int n){vec a(n);iota(all(a),0);return a;}
void print(){putchar(' ');}
void print(bool a){cout<<a;}
void print(int a){cout<<a;}
void print(long long a){cout<<a;}
void print(char a){cout<<a;}
void print(string &a){cout<<a;}
void print(double a){cout<<a;}
template<class T> void print(const vector<T>&);
template<class T, size_t size> void print(const array<T, size>&);
template<class T, class L> void print(const pair<T, L>& p);
template<class T, size_t size> void print(const T (&)[size]);
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } cout<<endl;}
template<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout<<" "; print(*i); } }
template<class T, class L> void print(const pair<T, L>& p){ cout<<'(';print(p.first); cout<<","; print(p.second);cout<<')'; }
template<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ cout<<" "; print(*i); } }
template<class T> void print(const T& a){ cout << a; }
int out(){ putchar('\n'); return 0; }
template<class T> int out(const T& t){ print(t); putchar('\n'); return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }
ll gcd(ll a, ll b){ while(b){ ll c = b; b = a % b; a = c; } return a; }
ll lcm(ll a, ll b){ if(!a || !b) return 0; return a * b / gcd(a, b); }
vector<pll> factor(ll x){ vector<pll> ans; for(ll i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }
vector<int> divisor(int x){ vector<int> ans; for(int i=1;i*i<=x;i++)if(x%i==0){ans.pb(i);if(i*i!=x)ans.pb(x/i);} return ans;}
int popcount(ll x){return __builtin_popcountll(x);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int n){return uniform_int_distribution<int>(0, n)(rng);}
// #define _GLIBCXX_DEBU
#define endl '\n'
#ifdef _MY_DEBUG
    #undef endl
    #define debug(x) cout<<#x<<": "<<x<<endl
    void err(){}
    template<class T> void err(const T& t){ print(t);  cout<<" ";}
    template<class Head, class... Tail> void err(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); }
#else
    #define debug(x)
    template<class... T> void err(const T&...){}
#endif
#pragma endregion


using ar = array<short,4>;
using AR = array<ll,4>;
constexpr ll T[4]={1,1000,1000000,1000000000};
inline ll f(const ar &x,int k){
    ll res=0;
    rep(i,4)res+=T[(i+k)&3]*x[i];
    return res;
}


signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);cout<<fixed<<setprecision(15);int n = in();
    array<ar,400> v;
    rep(i,n){
        rep(j,4)cin >> v[i][j];
    }
    array<AR,400> a;
    rep(i,n){
        rep(j,4){
            a[i][j] = f(v[i],j);
        }
    }
    ll ans = 0;
    rep(i,n){
        rep2(j,i+1,n-1){
            AR s;
            rep(k,4){
                rep(ii,4){
                    s[ii] = f(ar{v[i][(4+1-ii)&3],v[i][(4-ii)&3],v[j][(1+k+ii)&3],v[j][(k+ii)&3]},0);
                }
                array<ll,16> dp{1,0,0,0};
                rep2(ii,i+1,n-1){
                    if(ii==j)continue;
                    AR cnt{0,0,0,0};
                    rep(t,4)rep(tt,4)if(s[t] == a[ii][tt])cnt[t]++;
                    dp[15]+=dp[14]*cnt[0];
                    dp[15]+=dp[13]*cnt[1];
                    dp[15]+=dp[11]*cnt[2];
                    dp[15]+=dp[7]*cnt[3];
                    dp[14]+=dp[12]*cnt[1];
                    dp[14]+=dp[10]*cnt[2];
                    dp[14]+=dp[6]*cnt[3];
                    dp[13]+=dp[12]*cnt[0];
                    dp[13]+=dp[9]*cnt[2];
                    dp[13]+=dp[5]*cnt[3];
                    dp[12]+=dp[8]*cnt[2];
                    dp[12]+=dp[4]*cnt[3];
                    dp[11]+=dp[10]*cnt[0];
                    dp[11]+=dp[9]*cnt[1];
                    dp[11]+=dp[3]*cnt[3];
                    dp[10]+=dp[8]*cnt[1];
                    dp[10]+=dp[2]*cnt[3];
                    dp[9]+=dp[8]*cnt[0];
                    dp[9]+=dp[1]*cnt[3];
                    dp[8]+=dp[0]*cnt[3];
                    dp[7]+=dp[6]*cnt[0];
                    dp[7]+=dp[5]*cnt[1];
                    dp[7]+=dp[3]*cnt[2];
                    dp[6]+=dp[4]*cnt[1];
                    dp[6]+=dp[2]*cnt[2];
                    dp[5]+=dp[4]*cnt[0];
                    dp[5]+=dp[1]*cnt[2];
                    dp[4]+=dp[0]*cnt[2];
                    dp[3]+=dp[2]*cnt[0];
                    dp[3]+=dp[1]*cnt[1];
                    dp[2]+=dp[0]*cnt[1];
                    dp[1]+=dp[0]*cnt[0];
                }
                ans += dp[15];
            }
        }
    }
    cout << ans << endl;


            
            
}
            


Measured memory_bytes: 256