//#define _GLIBCXX_DEBUG

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}  
struct Dict{
  map<ll,int>mp;
  const ll tmp=(1<<10)-1;
  ll access(ll now){
    ll ret=0;
    rep(i,0,4){
      ret+=mp[now];
      now=shift(now);
    }
    return max(0LL,ret);
  }
  void change(ll v,ll w){
    mp[v]+=w;
    if(mp[v]==0)mp.erase(v);
  }
  ll trans(const vector<short>&v){
    return v[0]+((ll)v[1]<<10)+((ll)v[2]<<20)+((ll)v[3]<<30);
  }
  ll trans(short a,short b,short c,short d){
    return a+((ll)b<<10)+((ll)c<<20)+((ll)d<<30);
  }
  ll shift(ll x){
    return (x>>10)+((x&tmp)<<30);
  }
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  auto c=vec(n,4,short(0));
  rep(i,0,n)rep(j,0,4)cin>>c[i][j];
  vector<ll>t(n);
  Dict dict;
  rep(i,0,n){
    t[i]=dict.trans(c[i]);
    dict.mp[t[i]]++;
  }
  rep(i,0,n){
    dict.change(t[i],-1);
    rep(j,i+1,n){
      dict.change(t[j],-1);
      rep(jj,0,4){
        vector<short>now(4);
        rep(k,0,4){
          now[k]=c[j][(k+jj)%4];
        }
        ll tmp=1;
        vector<ll>ret(4);
        ret[0]=dict.trans(c[i][1],c[i][0],now[1],now[0]);
        ret[1]=dict.trans(c[i][2],c[i][1],now[0],now[3]);
        ret[2]=dict.trans(c[i][3],c[i][2],now[3],now[2]);
        ret[3]=dict.trans(c[i][0],c[i][3],now[2],now[1]);
        rep(k,0,4){
          tmp*=dict.access(ret[k]);
          dict.change(ret[k],-1);
        }
        rep(k,0,4)dict.change(ret[k],1);
        res+=tmp;
      }
      dict.change(t[j],1);
    }
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 239744