Problem: 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

Solution (in CPP):

Solution:
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
template <class T> int __builtin_popcount(T n) { return n ? 1 + __builtin_popcount(n & (n - 1)) : 0; }
#endif

#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define popcount __builtin_popcount
#define CLEAR(arr, val) memset(arr, val, sizeof(arr))

#define rep(i, n) for (int i = 0; i < n; ++i)

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

typedef long long ll;
typedef pair<int, int> pint;

const double PI = acos(-1.0);
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };



template <class T>
T next_combination(T combi)
{
	T leastBit = combi & -combi;
	T mostBits = combi + leastBit;
	T leastSequentialBits = combi & ~mostBits;
	return mostBits | ((leastSequentialBits / leastBit) >> 1);
}
int rev(int n)
{
	int res = 0;
	for (int i = 0; i < 5; ++i)
		res = (res << 1) | (n >> i & 1);
	return res;
}
bool can_construct(const vector<int>& ver, const vector<int>& hor)
{
	vector<int> v(5, 0);
	for (int i = 0; i < 5; ++i)
		for (int j = 0; j < 5; ++j)
			v[i] |= (ver[j] >> i & 1) << j;

	const int fit = (1 << 5) - 1;
	bool used[5];
	fill_n(used, 5, false);
	for (int i = 0; i < 5; ++i)
	{
		for (int j = 0; j < 5; ++j)
		{
			if (!used[j] && ((v[i] ^ hor[j]) == fit || (v[i] ^ rev(hor[j])) == fit))
			{
				used[j] = true;
				break;
			}
		}
	}


	return count(used, used + 5, true) == 5;
}
int main()
{
	while (true)
	{
		vector<int> block;
		for (int i = 0; i < 10; ++i)
		{
			char buf[16];
			scanf("%s", buf);
			if (*buf == 'E')
				return 0;
			int b = 0;
			for (int j = 0; j < 5; ++j)
				b = (b << 1) | (buf[j] == '1');
			block.push_back(b);
		}
		for (int i = 0; i < 9; ++i)
			if (block[i] != rev(block[i]))
				swap(block[i], block[9]);
		sort(block.begin(), block.begin() + 9);

		int res = 0;
		for (int i = 0; i < 3; ++i)
		{
			int r = 0;
			for (int j = (1 << 4) - 1; j < 1 << 9; j = next_combination(j))
			{
				vector<int> ver, hor;
				for (int k = 0, l = 0; k < 9; ++k)
				{
					if (j >> k & 1)
						ver.push_back(block[k]);
					else
						hor.push_back(block[k]);
				}

				do
				{
					for (int k = 0; k < 1 << 4; ++k)
					{
						bool any_synmetric = false;
						vector<int> v = ver;
						for (int l = 0; l < 4; ++l)
						{
							if (k >> l & 1)
							{
								if (v[l] == rev(v[l]))
								{
									any_synmetric = true;
									break;
								}
								v[l] = rev(v[l]);
							}
						}
						if (any_synmetric)
							continue;

						v.insert(v.begin() + i, block[9]);
						if (can_construct(v, hor))
							++r;
					}
				} while (next_permutation(all(ver)));
			}

			if (i == 2)
				r /= 2;
			res += r;
		}
		printf("%d\n", res);
	}
}