#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
 #define int long long
 #define inf  1000000007
 #define pa pair<int,int>
 #define ll long long
 #define pal pair<double,double>
 #define ppap pair<pa,int>
//  #define PI 3.14159265358979323846
  #define paa pair<int,char>
  #define  mp make_pair
  #define  pb push_back
  #define EPS (1e-10)
                                          
    int dx[8]={0,1,0,-1,1,1,-1,-1};
    int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            using namespace std;
                                   			class pa3{
                                            	public:
                                            	int x,y,z;
                                            	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
                                            	bool operator < (const pa3 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		 return z<p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                   				bool operator > (const pa3 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		 return z>p.z;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa3 &p) const{
                                            		return x==p.x && y==p.y && z==p.z;
                                            	}
                                            		bool operator != (const pa3 &p) const{
                                            			return !( x==p.x && y==p.y && z==p.z);
                                            	}
                                            
                                            };
                                            
                                            class pa4{
                                            	public:
                                            	int x;
                                            	int y,z,w;
                                            	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
                                            	bool operator < (const pa4 &p) const{
                                            		if(x!=p.x) return x<p.x;
                                            		if(y!=p.y) return y<p.y;
                                            		if(z!=p.z)return z<p.z;
                                            		return w<p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator > (const pa4 &p) const{
                                            		if(x!=p.x) return x>p.x;
                                            		if(y!=p.y) return y>p.y;
                                            		if(z!=p.z)return z>p.z;
                                            		return w>p.w;
                                            		//return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa4 &p) const{
                                            		return x==p.x && y==p.y && z==p.z &&w==p.w;
                                            	}
                                            		
                                            
                                            };
                                            class pa2{
                                            	public:
                                            	int x,y;
                                            	pa2(int x=0,int y=0):x(x),y(y) {}
                                            	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
                                            	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
                                            	bool operator < (const pa2 &p) const{
                                            		return y != p.y ? y<p.y: x<p.x;
                                            	}
                                            	bool operator > (const pa2 &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const pa2 &p) const{
                                            		return abs(x-p.x)==0 && abs(y-p.y)==0;
                                            	}
                                            	bool operator != (const pa2 &p) const{
                                            		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
                                            	}
                                            		
                                            
                                            };
                                            
/*
                                            class Point{
                                            	public:
                                            	double x,y;
                                            	Point(double x=0,double y=0):x(x),y(y) {}
                                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                                            	Point operator * (double a) {return Point(x*a,y*a);}
                                            	Point operator / (double a) {return Point(x/a,y/a);}
                                            	double absv() {return sqrt(norm());}
                                            	double norm() {return x*x+y*y;}
                                            	bool operator < (const Point &p) const{
                                            		return x != p.x ? x<p.x: y<p.y;
                                            	}
                                            	bool operator == (const Point &p) const{
                                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                                            	}
                                            };
                                            typedef Point Vector;
                                     #define pl pair<int,pas>
                                            struct Segment{
                                            Point p1,p2;
                                            };
                                             double dot(Vector a,Vector b){
                                            	return a.x*b.x+a.y*b.y;
                                            }
                                            double cross(Vector a,Vector b){
                                            	return a.x*b.y-a.y*b.x;
                                            }
                                        
                bool parareru(Point a,Point b,Point c,Point d){
                //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
                	return abs(cross(a-b,d-c))<EPS;
                }
                double distance_ls_p(Point a, Point b, Point c) {
                  if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
                  if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
                  return abs(cross(b-a, c-a)) / (b-a).absv();
                }
                bool is_intersected_ls(Segment a,Segment b) {
                	if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
                	if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){
                //		cout<<"sss"<<endl;
                		if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
                		if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
                		if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
                		if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
                		return false;
                	}
                  else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
                }
                 
                double segment_dis(Segment a,Segment b){
                	if(is_intersected_ls(a,b))return 0;
                	double r=distance_ls_p(a.p1, a.p2, b.p1);
                	r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
                	r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
                	return r;
                }
                Point intersection_ls(Segment a, Segment b) {
                  Point ba = b.p2-b.p1;
                  double d1 = abs(cross(ba, a.p1-b.p1));
                  double d2 = abs(cross(ba, a.p2-b.p1));
                  double t = d1 / (d1 + d2);
                 
                  return a.p1 + (a.p2-a.p1) * t;
                }
 */                
                                string itos( int i ) {
                                ostringstream s ;
                                s << i ;
                                return s.str() ;
                                }
                                 
                                int gcd(int v,int b){
                                	if(v>b) return gcd(b,v);
                                	if(v==b) return b;
                                	if(b%v==0) return v;
                                	return gcd(v,b%v);
                                }
                 
                                double distans(double x1,double y1,double x2,double y2){
                                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                                	return sqrt(rr);
                                	
                                }
                                int mod;
                                
                int pr[500010];
                int inv[500010];
                
                int beki(int wa,int rr,int warukazu){
                	if(rr==0) return 1%warukazu;
                	if(rr==1) return wa%warukazu;
                	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
                	ll zx=beki(wa,rr/2,warukazu);
                	return (zx*zx)%warukazu;
                }
    double bekid(double w,int r){
    	if(r==0) return 1.0;
    	if(r==1) return w;
    	if(r%2) return bekid(w,r-1)*w;
    	double f=bekid(w,r/2);
    	return f*f;
    }
                
    			int comb(int nn,int rr){
    				int r=pr[nn]*inv[rr];
    				r%=mod;
    				r*=inv[nn-rr];
    				r%=mod;
    				return r;
    			}
                /*
                void gya(int ert){
                	pr[0]=1;
                	for(int i=1;i<ert;i++){
                		pr[i]=(pr[i-1]*i)%mod;
                	}
                	for(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);
                	
                }
                */
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
                                         //----------------kokomade tenpure------------
                //vector<double> ans(100000000),ans2(100000000)

pa4 rot(pa4 z){
	return {z.w,z.x,z.y,z.z};
}
int hen(pa4 z){
	return z.x+1000*z.y+1000000*z.z+1000000000*z.w;
}


int ki(int z0){
	int ans=z0;
	for(int i=0;i<3;i++){
		int am=z0%1000;
		z0/=1000;
		z0+=am*1000000000ll;
		ans=min(ans,z0);
	}
	return ans;
}

int tai(int z){
	int y0=z%1000;
	z/=1000;
	int y1=z%1000;
	z/=1000;
	int y2=z%1000;
	z/=1000;
	int y3=z%1000;
	z/=1000;
	
	if(y1==y2 && y1==y0 && y1==y3) return 4;
	if(y1==y3 && y0==y2) return 2;
	return 1;
}
pa4 iro[400][4];

int kijun[400];
map<int,int> K; 
int b(int n,int r){
	if(r==0) return 1;
	if(r==1) return n;
	if(r%2)return b(n,r-1)*n;
	int z=b(n,r/2);
	return z*z;
}
  signed main(){
    	       cin.tie(0);
    			ios::sync_with_stdio(false);
int n;
  	cin>>n;
 // n=400;	
  	for(int i=0;i<n;i++){
  		int y1,y2,y3,y4;
  		cin>>y1>>y2>>y3>>y4;
  	//	y1=0,y2=0,y3=0,y4=0;
  		iro[i][0]={y1,y2,y3,y4};
  		for(int j=1;j<4;j++)iro[i][j]=rot(iro[i][j-1]);
  		kijun[i]=ki(hen(iro[i][0]));
  		K[kijun[i]]++;
  	
  	}
  	
  	int ans=0,amari=0;
  	for(int s=0;s<n;s++)for(int t=0;t<n;t++)if(s!=t)for(int l=0;l<4;l++)for(int r=0;r<4;r++){
  		
  		int e[4];
  		e[0]=hen({iro[s][l].x,iro[s][l].w,iro[t][r].x,iro[t][r].w});
  		e[1]=hen({iro[s][l].w,iro[s][l].z,iro[t][r].y,iro[t][r].x});
  		e[2]=hen({iro[s][l].z,iro[s][l].y,iro[t][r].z,iro[t][r].y});
  		e[3]=hen({iro[s][l].y,iro[s][l].x,iro[t][r].w,iro[t][r].z});
  		
  		for(int i=0;i<4;i++)e[i]=ki(e[i]);
  		K[kijun[s]]--;
  		K[kijun[t]]--;
  		bool bo=true;
  		for(int i=0;i<4;i++)if(K.count(e[i])==0||K[e[i]]==0) bo=false;
  		
  		if(bo){
  		//int cnt=0;
  		vector<pa> Pair;
  		map<int,int >w;
  		for(int i=0;i<4;i++){
  			w[e[i]]++;
  		}
  		int ka=1;
  			/*
  			for(auto it=w.begin();it!=w.end();it++){
  				cout<<it->first<<" "<<it->second<<endl;
  			}
  			cout<<endl;
  			*/
  		for(auto it=w.begin();it!=w.end();it++){
  			if(it->second==4){
  				int num=0;
  				if(K.count(it->first))num=K[it->first];
  				if(num<4){
  					ka=0;
  					break;
  				}
  				ka*=num*(num-1)*(num-2)*(num-3)*b(tai(it->first),4);
  			}
  			if(it->second==3){
  				int num=0;
  				if(K.count(it->first))num=K[it->first];
  				if(num<3){
  					ka=0;
  					break;
  				}
  				ka*=num*(num-1)*(num-2)*b(tai(it->first),3);
  			}
  			
  			if(it->second==2){
  				int num=0;
  				if(K.count(it->first))num=K[it->first];
  				if(num<2){
  					ka=0;
  					break;
  				}
  				ka*=num*(num-1)*b(tai(it->first),2);
  			}
  			
  			if(it->second==1){
  				int num=0;
  				if(K.count(it->first))num=K[it->first];
  				if(num<1){
  					ka=0;
  					break;
  				}
  		//		cout<<tai(it->first)<<endl;
  				ka*=num*b(tai(it->first),1);
  			}
  		}
  			//cout<<ka<<endl;
  			ans+=ka/24;
  			amari+=ka%24;
  			while(amari>=24){
  			amari-=24;
  				ans++;
  			}
  		}
  		
  		K[kijun[s]]++;
  		K[kijun[t]]++;
  	}
  	assert(amari==0);
  	
  	cout<<ans<<endl;
  	
  	
  	return 0;
    }



Measured memory_bytes: 384