#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair


class Dice {
public:
	int u, d, r, l, f, b;
	int x, y;
	string rot;

	map<pii, int> mp;
	int sum = 0;

	Dice(){}
	void input(){
		cin >> x >> y;
		cin >> l >> r >> f >> b >> d >> u;
		cin >> rot;
		mp[pii(x, y)] = d;
        sum += d;
	}

	void rotate() {
		rep (i, rot.size()) {
			char c = rot[i];
			if (c == 'R') {
				int temp = r;
				r = u; u = l; l = d; d = temp;
				x++;
			}
			else if (c == 'L') {
				int temp = u;
				u = r; r = d; d = l; l = temp;
				x--;
			}
			else if (c == 'F') {
				int temp = u;
				u = b; b = d; d = f; f = temp;
				y--;
			}
			else {
				int temp = u;
				u = f; f = d; d = b; b = temp;
				y++;
			}
			sum -= mp[pii(x, y)];
			mp[pii(x, y)] = d;
			sum += mp[pii(x, y)];
		}
	}

};

void solve(int n) {
	vector<Dice> dice(n);
	rep (i, n) {
		dice[i].input();
		dice[i].rotate();
	}

	set<pii> all_p;
	rep (i, n) {
		for (auto itr = dice[i].mp.begin(); itr != dice[i].mp.end(); itr++) {
			all_p.insert(itr->first);
		}
	}

	map<pii, int> p2u;
	int cnt = 0;
	for (auto itr = all_p.begin(); itr != all_p.end(); itr++) {
		p2u[*itr] = cnt++;
	}

	vector<int> out(cnt);
	rep (i, n) {
		for (auto itr = dice[i].mp.begin(); itr != dice[i].mp.end(); itr++) {
			pii p = itr->first;
			int u = p2u[p];
			out[u] += (1 << i);
		}
	}

	vector<int> dp(1 << n);

	rep (i, 1 << n) {
		rep (j, n) {
			if (i & (1 << j)) continue;
			int ni = i + (1 << j);
			int add = dice[j].sum;
			for (auto itr = dice[j].mp.begin(); itr != dice[j].mp.end(); itr++) {
				pii p = itr->first;
				int score = itr->second;
				int u = p2u[p];
				if (out[u] & (~ni)) {
					add -= score;
				}
			}
			dp[ni] = max(dp[ni], dp[i] + add);
		}
	}
	int ans = 0;
	rep (i, 1 << n) {
		ans = max(ans, dp[i]);
	}
	cout << ans << endl;
}

int main() {
	while (true) {
		int n;
		cin >> n;
		if (n == 0) return 0;
		solve(n);
	}
}



Measured memory_bytes: 3264