#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=200005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

int n,a[405][4];
map<ll,int> cnt;

inline pair<ll,int> make(int *a){
	ll ans=1ll<<60;int cnt=0;
	for(int i=0;i<4;i++){
		ll res=0;
		for(int j=0;j<4;j++)
			res=res*1000+a[(i+j)%4];
		if(res<ans) ans=res,cnt=1;
		else if(res==ans) cnt++;
	}
	return mp(ans,cnt);
}
inline pair<ll,int> make(int a,int b,int c,int d){
	static int x[10];
	x[0]=a;x[1]=b;x[2]=c;x[3]=d;
	return make(x);
}


int main(){
#ifdef rqgao2014
	freopen("input.txt","r",stdin);
#endif
	read(n);
	for(int i=1;i<=n;i++){
		for(int j=0;j<4;j++)
			read(a[i][j]);
		cnt[make(a[i]).FF]++;
//		debug(make(a[i]));
	}
	ll ans=0;
	for(int i=1;i<=n;i++){
		cnt[make(a[i]).FF]--;
		for(int j=i+1;j<=n;j++){
			if(i==j) continue;
			cnt[make(a[j]).FF]--;
			for(int k=0;k<4;k++){
				static ll b[10],res;
				res=1;
				for(int c=0;c<4;c++){
					pair<ll,int> tmp=make(a[i][(c+1)&3],a[i][c],a[j][(k-c)&3],a[j][(k-c-1)&3]);
					b[c]=tmp.FF;res*=tmp.SS;
				}
				for(int c=0;c<4;c++)
					res=res*cnt[b[c]],cnt[b[c]]--;
				ans+=res;
				for(int c=0;c<4;c++)
					cnt[b[c]]++;
			}
			cnt[make(a[j]).FF]++;
		}
	}
	print(ans);
	return 0;
}

Measured memory_bytes: 80128