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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

vector<int> vf[410];

ll same(const vector<int> &v){
  ll res = 0;
  vector<int> e(4); rep(i, 4)e[i] = i;
  rep(i_, 4){
    vector<int> vt(4); rep(i, 4)vt[i] = v[e[i]];
    if(v == vt)++res;
    rotate(e.begin(), e.begin() + 1, e.end());
  }
  return res;
}

vector<int> regularize(vector<int> v){
  vector<int> res = v;
  vector<int> e(4); rep(i, 4)e[i] = i;
  rep(i_, 3){
    rotate(e.begin(), e.begin() + 1, e.end());
    vector<int> vt(4); rep(i, 4)vt[i] = v[e[i]];
    res = min(res, vt);
  }
  return res;
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  rep(i, n)rep(j, 4){
    int c; cin >> c;
    vf[i].pb(c);
  }
  map<vector<int>, set<int>> mp;
  rep(i, n){
    mp[regularize(vf[i])].insert(i);
  }
  ll res = 0;
  rep(i, n){
    mp[regularize(vf[i])].erase(i);
    FOR(j, i + 1, n){
      mp[regularize(vf[j])].erase(j);

      vector<int> e(4);
      rep(k, 4)e[k] = k;
      reverse(all(vf[j]));
      rep(i_, 4){
        map<vector<int>, int> cnt;
        ll tmp = 1;
        vector<int> vtt = vector<int>{vf[i][1], vf[i][0], vf[j][e[0]], vf[j][e[1]]};
        cnt[regularize(vtt)]++;
        vtt = vector<int>{vf[i][2], vf[i][1], vf[j][e[1]], vf[j][e[2]]};
        cnt[regularize(vtt)]++;
        vtt = vector<int>{vf[i][3], vf[i][2], vf[j][e[2]], vf[j][e[3]]};
        cnt[regularize(vtt)]++;
        vtt = vector<int>{vf[i][0], vf[i][3], vf[j][e[3]], vf[j][e[0]]};
        cnt[regularize(vtt)]++;
        irep(itr, cnt){
          ll cn = sz(mp[itr->first]);
          if(itr->second == 1)tmp *= cn;
          else if(itr->second == 2)tmp *= cn * (cn - 1);
          else if(itr->second == 3)tmp *= cn * (cn - 1) * (cn - 2);
          else tmp *= cn * (cn - 1) * (cn - 2) * (cn - 3);
          rep(k, itr->second)tmp *= same(itr->first);
        }
        rotate(e.begin(), e.begin() + 1, e.end());
        res += tmp;
      }
      reverse(all(vf[j]));

      mp[regularize(vf[j])].insert(j);
    }
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 179840