#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>
#include<numeric>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
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 long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; 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 << 19;
modint fact[max_n], factinv[max_n];
void init_f() {
	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];
}
struct BIT {
private:
	vector<ll> node; int n;
public:
	BIT(int n_) {
		n = n_; node.resize(n, 0);
	}
	//0-indexed
	void add(int a, ll w) {
		for (int i = a; i < n; i |= i + 1)node[i] += w;
	}
	//[0,a)
	ll sum(int a) {
		ll ret = 0;
		for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];
		return ret;
	}
	//[a,b)
	ll sum(int a, int b) {
		return sum(b) - sum(a);
	}
};
void solve() {
	int n; cin >> n;
	vector<int> x(n), y(n); vector<char> c(n);
	rep(i, n)cin >> x[i] >> y[i] >> c[i];
	vector<int> a(n);
	rep(i, n) {
		if (c[i] == 'U')a[i] = 0;
		else if (c[i] == 'D')a[i] = 1;
		else if (c[i] == 'R')a[i] = 2;
		else a[i] = 3;
	}
	int ans = 10000000;
	//tate
	{
		vector<pair<int,P>> vs;
		rep(i, n)if (a[i] < 2) {
			vs.push_back({ x[i],{y[i],a[i]} });
		}
		sort(all(vs));
		rep(i, (int)vs.size() - 1) {
			if (vs[i].first == vs[i + 1].first) {
				int ly = vs[i].second.first;
				int lc = vs[i].second.second;
				int ry = vs[i + 1].second.first;
				int rc = vs[i+1].second.second;
				if (lc == 0 && rc == 1) {
					ans = min(ans, 5 * (ry - ly));
				}
			}
		}
	}
	//yoko
	{
		vector<pair<int, P>> vs;
		rep(i, n)if (a[i] >= 2) {
			vs.push_back({ y[i],{x[i],a[i]-2} });
		}
		sort(all(vs));
		rep(i, (int)vs.size() - 1) {
			if (vs[i].first == vs[i + 1].first) {
				int ly = vs[i].second.first;
				int lc = vs[i].second.second;
				int ry = vs[i + 1].second.first;
				int rc = vs[i + 1].second.second;
				if (lc == 0 && rc == 1) {
					ans = min(ans, 5 * (ry - ly));
				}
			}
		}
	}
	rep(t, 4) {
		vector<pair<int, P>> vs;
		rep(i, n) {
			if (a[i] == 0) {
				vs.push_back({ x[i] + y[i],{y[i],0} });
			}
			else if (a[i] == 2) {
				vs.push_back({ x[i] + y[i],{y[i],1} });
			}
		}
		sort(all(vs));
		int le = -10000000;
		rep(i, vs.size()) {
			if (i == 0 || vs[i].first != vs[i - 1].first)le = -10000000;
			if (vs[i].second.second == 0) {
				le = vs[i].second.first;
			}
			else {
				int dif = vs[i].second.first - le;
				if (dif < 0) {
					cout << "ha? " << le << " " << vs[i].second.first << "\n";
				}
				ans = min(ans, dif * 10);
			}
		}

		rep(i, n) {
			swap(x[i], y[i]);
			x[i] *= -1;
			if (a[i] == 0)a[i] = 3;
			else if (a[i] == 1)a[i] = 2;
			else if (a[i] == 2)a[i] = 0;
			else a[i] = 1;
		}
	}
	if (ans==10000000) {
		cout << "SAFE\n";
	}
	else {
		cout << ans << "\n";
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//cout << grandy(2, 3, false, false) << "\n";
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}


Measured memory_bytes: 18984