#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
string s[10];
int lat[10][5];
int grid[5][5];
bool symmetory[10];
int dfs(int p, vector<bool> used){
  if(p < 5){
    int res = 0;
    for(int i = 0; i < 10; i++) if(!used[i]){
      used[i] = true;
      REP(j, 5) grid[j][p] = lat[i][j] ^ 1;
      res += dfs(p + 1, used);
      REP(j, 5) grid[4 - j][p] = lat[i][j] ^ 1;
      if(!symmetory[i])res += dfs(p + 1, used);
      used[i] = false;
    }
    return res;
  }else if(p < 10){
    int res = 0;
    for(int i = 0; i < 10; i++) if(!used[i]){
      used[i] = true;
      bool ok = true;
      REP(j, 5) if(grid[p - 5][j] != lat[i][j]) ok = false;
      if(ok) res += dfs(p + 1, used);
      ok = true;
      REP(j, 5) if(grid[p - 5][j] != lat[i][4 - j]) ok = false;
      if(ok && !symmetory[i]) res += dfs(p + 1, used);
      used[i] = false;
    }
    return res;
  }else{
    return 1;
  }
}

int main(){
  while(cin >> s[0]){
    if(s[0] == "END") break;
    REP(i, 9) cin >> s[i + 1];
    REP(i, 10){
      string t = s[i];
      reverse(t.begin(), t.end());
      symmetory[i] = (s[i] == t);
    }
    REP(i, 10) REP(j, 5) lat[i][j] = s[i][j] - '0';
    vector<bool> used(10);
    cout << dfs(0, used)/8 << endl;
  }
  return 0;
}