Once upon a time, there was a king who loved beautiful costumes very much. The king had a special cocoon bed to make excellent cloth of silk. The cocoon bed had 16 small square rooms, forming a 4 × 4 lattice, for 16 silkworms. The cocoon bed can be depicted as follows:

<image>

The cocoon bed can be divided into 10 rectangular boards, each of which has 5 slits:

<image>

Note that, except for the slit depth, there is no difference between the left side and the right side of the board (or, between the front and the back); thus, we cannot distinguish a symmetric board from its rotated image as is shown in the following:

<image>

Slits have two kinds of depth, either shallow or deep. The cocoon bed should be constructed by fitting five of the boards vertically and the others horizontally, matching a shallow slit with a deep slit.

Your job is to write a program that calculates the number of possible configurations to make the lattice. You may assume that there is no pair of identical boards. Notice that we are interested in the number of essentially different configurations and therefore you should not count mirror image configurations and rotated configurations separately as different configurations.

The following is an example of mirror image and rotated configurations, showing vertical and horizontal boards separately, where shallow and deep slits are denoted by '1' and '0' respectively.

<image>

Notice that a rotation may exchange position of a vertical board and a horizontal board.



Input

The input consists of multiple data sets, each in a line. A data set gives the patterns of slits of 10 boards used to construct the lattice. The format of a data set is as follows:


XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX XXXXX


Each x is either '0' or '1'. '0' means a deep slit, and '1' a shallow slit. A block of five slit descriptions corresponds to a board. There are 10 blocks of slit descriptions in a line. Two adjacent blocks are separated by a space.

For example, the first data set in the Sample Input means the set of the following 10 boards:

<image>

The end of the input is indicated by a line consisting solely of three characters "END".

Output

For each data set, the number of possible configurations to make the lattice from the given 10 boards should be output, each in a separate line.

Example

Input

10000 01000 00100 11000 01100 11111 01110 11100 10110 11110
10101 01000 00000 11001 01100 11101 01110 11100 10110 11010
END


Output

40
6
import java.io.BufferedReader;
import java.io.InputStreamReader;

//public class Problem1201_LatticePractices {
public class Main {
	
	public static void main(String[] args) {
		try {
		//	Problem1201_LatticePractices test = new Problem1201_LatticePractices();
			Main test = new Main();
			
			BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		//	
			String line;
			while((line = reader.readLine()) != null) {
				if(line.equals("END")) {
					break;
				}
				test.showAnswer(line);
			}
		//	
			
		//	test.showAnswer("10000 01000 00100 00110 11111 01110 10110 11000 11100 11110");
		} catch(Exception e) {
			e.printStackTrace();
		}
	}
	void showAnswer(String line) {
		Board[] boards = createBoards(line);
		int result = getPossibleConfigration(boards);
		System.out.println(result);
	//	System.out.println(getConfigrationNumber(boards, 1, 2, 3, 4));
		
	}
	Board[] createBoards(String line) {
		String[] textArray = line.split(" ");
		
		Board[] boards = new Board[10];
		for(int i = 0; i < 10; i++) {
			String text = textArray[i];
			boolean[] slits = new boolean[5];
			for(int j = 0; j < 5; j++) {
				char depth = text.charAt(j);
				if(depth == '1') {
					slits[j] = true;
				} else if(depth == '0') {
					slits[j] = false;
				} else {
					throw new IllegalArgumentException("eLXgªs³ : " + text + "\tÁÉ" + i + "ÔÚ");
				}
			}
			boards[i] = new Board(slits);
		}
		return boards;
	}
	int getPossibleConfigration(Board[] boards) {
		int possibleCount = 0;
		for(int i = 1; i < 7; i++) {
			for(int j = i+1; j < 8; j++) {
				for(int k = j+1; k < 9; k++) {
					for(int l = k+1; l < 10; l++) {
						int configrationNumber = getConfigrationNumber(boards, i, j, k, l);
						possibleCount += configrationNumber;
					}
				}
			}
		}
		return possibleCount;
	}
	private int getConfigrationNumber(Board[] boards, int second, int third, int fourth, int fifth) {
		if(boards.length != 10) {
			throw new IllegalArgumentException("boards.lengthªs³ : " + boards.length);
		}
		int result = 0;
		Board[][] dividedBoard = createDividedBoards(boards, 0, second, third, fourth, fifth);
		Board[] originalHorizontalBoards = dividedBoard[0];
		BoardList originalVerticalBoardList = new BoardList(dividedBoard[1]);
		SuccessBedStack successBedStack = new SuccessBedStack();
		for(int i = 0; i < 5; i++) {
		//	System.out.println("fJ[v" + i  + "ñÚ");	/*************
			CocoonBed bed = new CocoonBed();
			BedStack cocoonBedStack = new BedStack();
			BoardList originalHorizontalBoardList = new BoardList(originalHorizontalBoards);
			originalHorizontalBoardList.delete(originalHorizontalBoards[i]);
			bed.setHorizontalBoard(originalHorizontalBoards[i]);
			bed.setVerticalBoardCandidates(originalVerticalBoardList);
			
			bed.setHorizontalBoardCandidates(originalHorizontalBoardList);
			
			
			while(bed != null) {
		//	for(int j = 1; j < 10; j = bed.getNumberOfPutted()) {
				int puttedCount; 
				
				if((puttedCount = bed.getNumberOfPutted()) == 10) {
					if(successBedStack.exists(bed)) {
						//dont count
					} else {
						successBedStack.push(bed);
						result++;
					}
					bed = cocoonBedStack.pop();
			//		System.out.println("*****¬÷******");		/*************
				} else {
					int position = puttedCount / 2;
			//		System.out.println("~j[v" + puttedCount + "ÂzuÏÝ\tposition = "+ position);	/*************
				//	BoardList horizontalBoardList = bed.getHorizontalBoardCandidates();
				//	BoardList verticalBoardList = bed.getVerticalBoardCandidates();
					
					int[] positions = new int[(puttedCount+1)/2];
					for(int k = 0; k < positions.length; k++) {
						positions[k] = k;
					}
					if(puttedCount % 2 == 0) {		//ôÈç¡ûüÌzu
						BoardList horizontalBoardList = bed.getHorizontalBoardCandidates();
						Board[] candidates = horizontalBoardList.getPuttableBoards(positions, bed.getHorizontalRequiredSlit(position));
						
						for(int k = 0; k < candidates.length; k++) {
							Board candidateBoard = candidates[k];
						//	System.out.println("candidateBoard : " + candidateBoard);
							if(candidateBoard == null) {
								break;
							} else {
								CocoonBed newBed = bed.copy();
								newBed.setHorizontalBoard(candidateBoard);
								newBed.getHorizontalBoardCandidates().delete(candidateBoard);
								cocoonBedStack.push(newBed);
							}
						}
					} else {				//ïÈçcûüÌzu
						BoardList verticalBoardList = bed.getVerticalBoardCandidates();
					//	System.out.println("verticalBoardList: " + verticalBoardList);	/*************
						Board[] candidates = verticalBoardList.getPuttableBoards(positions, bed.getVerticalRequiredSlit(position));
						for(int k = 0; k < candidates.length; k++) {
							Board candidateBoard = candidates[k];
					//		System.out.println("candidateBoard : " + candidateBoard);	/*************
							if(candidateBoard == null) {
								break;
							} else {
								CocoonBed newBed = bed.copy();
								newBed.setVerticalBoard(candidateBoard);
								newBed.getVerticalBoardCandidates().delete(candidateBoard);
								cocoonBedStack.push(newBed);
							}
						}
					}
					bed = cocoonBedStack.pop();
				}
			}
		}
		return result;
	}
	private Board[][] createDividedBoards(Board[] boards, int first, int second, int third, int fourth, int fifth) {
		Board[][] dividedBoards = new Board[2][5];
		
		for(int i = 0, maincount = 0, subcount = 0; i < 10; i++) {
			if(i == fifth || i == fourth || i == third || i == second || i == first) {
				dividedBoards[0][maincount] = boards[i];
			//	System.out.println("main\t" + boards[i]);	/*************
				maincount++;
			} else {
				dividedBoards[1][subcount] = boards[i];
			//	System.out.println("sub\t" + boards[i]);	/*************
				subcount++;
			}
		}
		return dividedBoards;
	}
	private class SuccessBedStack {
		private BedNode top;
		final BedNode FLOOR_NODE = new BedNode(null);
		SuccessBedStack() {
			top = FLOOR_NODE;
		}
		void push(CocoonBed bed) {
			BedNode node = new BedNode(bed);
			node.setPreviousNode(top);
			top = node;
		}
		boolean exists(CocoonBed bed) {
			BedNode currentNode = top;
			
			while(currentNode != FLOOR_NODE) {
				if(currentNode.getBed().equals(bed)) {
					return true;
				} else {
					currentNode = currentNode.getPreviousNode();
				}
			}
			return false;
		}
	}
	private class BedNode {
		private BedNode previous;
		private CocoonBed node;
		
		BedNode(CocoonBed bed) {
			node = bed;
			previous = null;
		}
		CocoonBed getBed() {
			return node;
		}
		void setPreviousNode(BedNode bed) {
			previous = bed;
		}
		BedNode getPreviousNode() {
			return previous;
		}
	}
	private class BedStack {
		private CocoonBed top;
		
		BedStack() {
			top = null;
		}
		void push(CocoonBed bed) {
			bed.setPreviousBed(top);
			top = bed;
		}
		CocoonBed pop() {
			CocoonBed result = top;
			if(result == null) {
				return null;
			} else {
				top = top.getPreviousBed();
				return result;
			}
		}
	}
	private class CocoonBed {
		private CocoonBed previousBed;
		private Board[] horizontalBoard;
		private Board[] verticalBoard;
		private int verticalcount;
		private int horizontalcount;
		
		private BoardList horizontalBoardCandidates;
		private BoardList verticalBoardCandidates;
		
		CocoonBed() {
			setPreviousBed(null);
			horizontalBoard = new Board[5];
			verticalBoard = new Board[5];
			verticalcount = 0;
			horizontalcount = 0;
			
		}
		int getNumberOfPutted() {
			return horizontalcount + verticalcount;
		}
		boolean[] getHorizontalRequiredSlit(int rowNumber) {
		//	System.out.println("verticalcount: " + verticalcount);	/*************
			boolean[] result = new boolean[verticalcount];
			for(int i = 0; i < result.length; i++) {
				result[i] = (getVerticalBoard(i).isShallow(rowNumber) ? false : true);
			}
			return result;
		}
		boolean[] getVerticalRequiredSlit(int columnNumber) {
			boolean[] result = new boolean[horizontalcount];
			for(int i = 0; i < result.length; i++) {
				result[i] = (getHorizontalBoard(i).isShallow(columnNumber) ? false : true);
			//	System.out.println("getHorizontalBoard(" + i + ") = " + getHorizontalBoard(i));	/*************
			}
			return result;
		}
		void setHorizontalBoard(Board board) {
			horizontalBoard[horizontalcount] = board;
			horizontalcount++;
		//	System.out.println("¡ûüÌzu:" + board);	/*************
		}
		void setVerticalBoard(Board board) {
			verticalBoard[verticalcount] = board;
			verticalcount++;
		//	System.out.println("cûüÌzu:" + board);	/*************
		}
		Board getHorizontalBoard(int position) {
			return horizontalBoard[position];
		}
		Board getVerticalBoard(int position) {
			return verticalBoard[position];
		}
		Board[] getHorizontalBoards() {
			return horizontalBoard;
		}
		void setPreviousBed(CocoonBed bed) {
			previousBed = bed;
		}
		CocoonBed getPreviousBed() {
			return previousBed;
		}
		void setHorizontalBoardCandidates(BoardList list) {
			horizontalBoardCandidates = list;
		}
		void setVerticalBoardCandidates(BoardList list) {
			verticalBoardCandidates = list;
		}
		BoardList getHorizontalBoardCandidates() {
			return horizontalBoardCandidates;
		}
		BoardList getVerticalBoardCandidates() {
			return verticalBoardCandidates;
		}
		CocoonBed copy() {
			CocoonBed clone = new CocoonBed();
			for(int i = 0; i < horizontalcount; i++) {
				clone.setHorizontalBoard(getHorizontalBoard(i));
			}
			for(int i = 0; i < verticalcount; i++) {
				clone.setVerticalBoard(getVerticalBoard(i));
			}
			clone.setHorizontalBoardCandidates(getHorizontalBoardCandidates().copy());
			clone.setVerticalBoardCandidates(getVerticalBoardCandidates().copy());
			return clone;
		}
		private boolean isObverseHorizontalBoardsEquals(Board[] anotherHorizontalBoard) {
			for(int i = 0; i < horizontalBoard.length; i++) {
				if(horizontalBoard[i].isObverseEquals(anotherHorizontalBoard[i])) {
					//loop more
				} else {
					for(int j = 0; j < horizontalBoard.length; j++) {
						if(horizontalBoard[j].isObverseEquals(anotherHorizontalBoard[anotherHorizontalBoard.length - 1 - j])) {
							//loop more
						} else {
							return false;
						}
					}
					return true;
				}
			}
			return true;
		}
		private boolean isReverseHorizontalBoardsEquals(Board[] anotherHorizontalBoard) {
			for(int i = 0; i < horizontalBoard.length; i++) {
				if(horizontalBoard[i].isReverseEquals(anotherHorizontalBoard[i])) {
					//loop more
				} else {
					for(int j = 0; j < horizontalBoard.length; j++) {
						if(horizontalBoard[j].isReverseEquals(anotherHorizontalBoard[anotherHorizontalBoard.length - 1 - j])) {
							//loop more
						} else {
							return false;
						}
					}
					return true;
				}
			}
			return true;
		}
		@Override
		public boolean equals(Object o) {
			if(o instanceof CocoonBed) {
				CocoonBed another = (CocoonBed)o;
				
				Board[] anotherHorizontalBoard = another.getHorizontalBoards();
				if(isObverseHorizontalBoardsEquals(anotherHorizontalBoard)) {
					return true;
				}
				if(isReverseHorizontalBoardsEquals(anotherHorizontalBoard)) {
					return true;
				}
				return false;
			} else {
				return false;
			}
		}
		@Override
		public String toString() {
			StringBuilder resultBuilder = new StringBuilder();
			for(int i = 0; i < verticalBoard.length; i++) {
				resultBuilder.append(horizontalBoard[i]);
				resultBuilder.append("\t");
				resultBuilder.append(verticalBoard[i]);
				resultBuilder.append("\n");
			}
			return resultBuilder.toString();
		}
	}
	private class BoardList {
		private Board[] list;
		private int max;	//max-1 ÜÅªÎÛ maxÂ éÆ¢¤Ó¡
		
		BoardList(Board[] array) {
			Board[] newArray = new Board[array.length];
			System.arraycopy(array, 0, newArray, 0, newArray.length);
			this.list = newArray;
			max = list.length;
		}
		boolean delete(Board targetBoard) {
			boolean isDeleted = false;
		//	System.out.println("max:" + max);
			for(int i = 0; i < max; i++) {
				if(targetBoard.equals(list[i])) {
					for(int j = i; j < max-1; j++) {
						list[j] = list[j+1];
					}
					list[max-1] = null;
					max--;
					isDeleted = true;
				}
			}
			return isDeleted;
		}
		Board[] getPuttableBoards(int[] positions, boolean[] depths) {
			if(positions.length != depths.length) {
				throw new IllegalArgumentException("positions.length = " + positions.length + "depths.length = " + depths.length);
			}
			Board[] resultBoards = new Board[max*2];
			int count = 0;
			for(int i = 0; i < max; i++) {
				Board board = list[i];
				if(board.isPuttable(positions, depths)) {
				//	System.out.println("puttableBoards[" + count + "] = " + board);	/*************
					resultBoards[count] = board;
					count++;
				}
				if(board.isReversePuttable(positions, depths)) {
					Board reverseBoard = board.getReverseBoard();
					if(reverseBoard == null) {
						//do nothing
					} else {
				//		System.out.println("puttableBoards[" + count + "] = " + reverseBoard);	/*************
						resultBoards[count] = reverseBoard;
						count++;
					}
				}
			}
			
			return resultBoards;
		}
		BoardList copy() {
			Board[] trimmedArray = new Board[max];
			System.arraycopy(list, 0, trimmedArray, 0, max);
			return new BoardList(trimmedArray);
		}
		@Override
		public String toString() {
			StringBuilder resultBuilder = new StringBuilder();
			for(int i = 0; i < max; i++) {
				resultBuilder.append(list[i] + "\t");
			}
			return resultBuilder.toString();
		}
	}
	private class Board {
		private boolean[] slits;	//trueÈç1(shallow) falseÈç0(deep)
		
		Board(boolean[] slits) {
			if(slits.length == 5) {
				this.slits = slits;
			} else {
				throw new IllegalArgumentException("slits.lengthªs³ : " + slits.length);
			}
		}
		Board getReverseBoard() {
			boolean[] reverseSlits = new boolean[slits.length];
			if(isSymmetry()) {
				return null;
			}
			for(int i = 0; i < reverseSlits.length; i++) {
				reverseSlits[i] = slits[slits.length - i - 1];
			}
			return new Board(reverseSlits);
		}
		boolean isShallow(int number) {
			return slits[number];	//numberÌlªs³ÈçáOªÔé
		}
		boolean isSymmetry() {	//¶EÎÌ©Ç¤©
			for(int i = 0, j = slits.length; i < j; i++, j--) {
				if(slits[i] == slits[j-1]) {
					//loop more
				} else {
					return false;
				}
			}
			return true;
		}
		boolean[] getSlits() {
			return slits;
		}
		boolean isPuttable(int[] positions, boolean[] depths) {
			for(int i = 0; i < positions.length; i++) {
				if(isShallow(positions[i]) == depths[i]) {
					//loop more
				} else {
					return false;
				}
			}
			return true;
		}
		boolean isReversePuttable(int[] positions, boolean[] depths) {
			for(int i = 0; i < positions.length; i++) {
				if(isShallow(slits.length - positions[i] -1) == depths[i]) {
					//loop more
				} else {
					return false;
				}
			}
			return true;
		}
		boolean isReverseEquals(Board another) {
			boolean[] anotherSlits = another.getSlits();
			for(int i = 0; i < anotherSlits.length; i++) {
				if(slits[i] == anotherSlits[anotherSlits.length-1-i]) {
					//loop more
				} else {
					return false;
				}
			}
			return true;
		}
		boolean isObverseEquals(Board another) {
			boolean[] anotherSlits = another.getSlits();
			for(int i = 0; i < anotherSlits.length; i++) {
				if(slits[i] == anotherSlits[i]) {
					//loop more
				} else {
					return false;
				}
			}
			return true;
		}
		@Override
		public boolean equals(Object o) {
			if(o instanceof Board) {
				Board another = (Board)o;
				boolean[] anotherSlits = another.getSlits();
				for(int i = 0; i < 5; i++) {
					if(slits[i] == anotherSlits[i]) {
						//loop more
					} else {
						for(int j = 0; j < 5; j++) {
							if(slits[j] == anotherSlits[4-j]) {
								//loop more
							} else {
								return false;
							}
						}
						return true;
					}
				}
				return true;
			} else {
				return false;
			}
		}
		@Override
		public String toString() {
			StringBuilder result = new StringBuilder();
			for(boolean b : slits) {
				result.append(b ? 1 : 0);
			}
			return result.toString();
		}
	}
}