#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
int count=0;
int arr[12];
int arr_dfs[5];
int arr_bfs[3][4];
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
struct node{
	int x,y;
}s;
void bfs(int arr_dfs[5]){
	int x,y,sum=0;
	memset(arr_bfs,0,sizeof(arr_bfs));
	for(int i=0;i<5;i++){		
		if(arr_dfs[i]%4==0){
			x=arr_dfs[i]/4-1;
			y=3;
		}else{			
			x=arr_dfs[i]/4;
			y=arr_dfs[i]%4-1;
		}
		arr_bfs[x][y]=1;
	}
	s.x=x;
	s.y=y;
	queue<node>q;
	q.push(s);
	sum++;
	arr_bfs[x][y]=0;
	while(q.size()){
		node n;
		int tempX,tempY;
		s=q.front();
		q.pop();
		for(int i=0;i<4;i++){
			tempX=s.x+dx[i];
			tempY=s.y+dy[i];
			if(tempX>=0&&tempX<3&&tempY>=0&&tempY<4&&arr_bfs[tempX][tempY]==1){
				n.x=tempX;
				n.y=tempY;
				q.push(n);
				sum++;
				arr_bfs[tempX][tempY]=0; 
			}
		}
	}
	if(sum==5){
		count++;
	}
}
void dfs(int step,int temp){
	if(step==5){
		bfs(arr_dfs);
		return;
	}
	for(int i=temp;i<12;i++){
		arr_dfs[step]=arr[i];
		dfs(step+1,arr[i]);
		arr_dfs[step]=-1;
	}
}

int main(){
	memset(arr_dfs,-1,sizeof(arr_dfs));
	for(int i=0;i<12;i++){
		arr[i]=i+1;
	}
	dfs(0,0);
	cout<<count;
	return 0;
}