#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

//上、前、右、奥、左、下の順に
struct dice {
	int f[6];
	dice() {}
	dice(const vector<int> &v) {
		rep(i, 6)f[i] = v[i];
	}
	dice(int x) {
		rep(i, 6) {
			f[i] = x % 2;
			x /= 2;
		}
	}
};
dice ident(int a, int b) {
	dice res;
	int c;
	if (a == 1) {
		if (b == 2)c = 3;
		else if (b == 3)c = 5;
		else if (b == 5)c = 4;
		else c = 2;
	}
	else if (a == 2) {
		if (b == 1)c = 4;
		else if (b == 4)c = 6;
		else if (b == 6)c = 3;
		else c = 1;
	}
	else if (a == 3) {
		if (b == 1)c = 2;
		else if (b == 2)c = 6;
		else if (b == 5)c = 1;
		else c = 5;
	}
	else if (a == 4) {
		if (b == 1)c = 5;
		else if (b == 5)c = 6;
		else if (b == 6)c = 2;
		else c = 1;
	}
	else if (a == 5) {
		if (b == 1)c = 3;
		else if (b == 3)c = 6;
		else if (b == 6)c = 4;
		else c = 1;
	}
	else {
		if (b == 2)c = 4;
		else if (b == 3)c = 2;
		else if (b == 5)c = 3;
		else c = 5;
	}

	vector<int> z = { a,b,c,7 - b,7 - c,7 - a };
	dice ret(z);
	return ret;
}
dice rollfront(dice x) {
	vector<int> z = { x.f[3],x.f[0],x.f[2],x.f[5],x.f[4],x.f[1] };
	dice ret(z);
	return ret;
}
dice rollback(dice x) {
	vector<int> z = { x.f[1],x.f[5],x.f[2],x.f[0],x.f[4],x.f[3] };
	dice ret(z);
	return ret;
}
dice rollright(dice x) {
	vector<int> z = { x.f[4],x.f[1],x.f[0],x.f[3],x.f[5],x.f[2] };
	dice ret(z);
	return ret;
}
dice rollleft(dice x) {
	vector<int> z = { x.f[2],x.f[1],x.f[5],x.f[3],x.f[0],x.f[4] };
	dice ret(z);
	return ret;
}
void roll(dice &d, char &c, int &x, int &y) {
	if (c == 'L')d = rollleft(d), --x;
	else if (c == 'R')d = rollright(d), ++x;
	else if (c == 'F')d = rollfront(d), --y;
	else d = rollback(d), ++y;
}

struct status {
	int x, y;
	dice d;
	string ord;
};

status s[15];

using speP = pair<P, int>;

vector<speP> ori[15];

int val[3000][3000];
void make_b(int i) {
	ori[i].clear();
	int x = s[i].x;
	int y = s[i].y;
	dice d = s[i].d;
	string ord = s[i].ord;
	val[x][y] = d.f[5];
	vector<P> loc;
	loc.push_back({ x,y });
	for (char t : ord) {
		roll(d, t, x, y);
		val[x][y] = d.f[5];
		loc.push_back({ x,y });
	}
	sort(all(loc));
	loc.erase(unique(all(loc)), loc.end());
	for (P p : loc) {
		int x = p.first, y = p.second;
		ori[i].push_back({ {x,y},val[x][y] });
		val[x][y] = 0;
	}
}
const int ep = 1500;





vector<P> e[1 << 15];

void upd(int s, int id) {
	int ns = s ^ (1 << id);
	e[ns] = e[s];
	for (speP p : ori[id]) {
		e[ns].push_back(p.first);
	}
	sort(all(e[ns]));
	e[ns].erase(unique(all(e[ns])), e[ns].end());
}
int ad(int s, int id) {
	int res = 0;
	for (speP p : ori[id]) {
		int id = lower_bound(all(e[s]), p.first) - e[s].begin();
		if (id < e[s].size() && e[s][id] == p.first)continue;
		res += p.second;
	}
	return res;
}
int n;

int dp[1 << 15];
void solve() {
	rep(i, n) {
		int x, y; cin >> x >> y;
		x += ep; y += ep;
		int c[6];
		rep(j, 6)cin >> c[j];
		string ord; cin >> ord;
		s[i].x = x, s[i].y = y;
		s[i].d = vector<int>{ c[5],c[2],c[1],c[3],c[0],c[4] };
		s[i].ord = ord;
		make_b(i);
	}

	fill(dp, dp + (1 << n), -mod);
	dp[0] = 0;
	rep(i, (1 << n) - 1) {
		rep(j, n) {
			if (i&(1 << j))continue;
			int ni = i ^ (1 << j);
			dp[ni] = max(dp[ni], dp[i] + ad(i, j));
			upd(i, j);
		}
	}

	cout << dp[(1 << n) - 1] << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	//int t; cin >> t; rep(i, t)solve();
	while (cin >> n, n)solve();
	//solve();
	stop
		return 0;
}



Measured memory_bytes: 90044