/*
このコード、と～おれ!
Be accepted!
∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂　　 ノ 　　　・゜+.
　しーＪ　　　°。+ *´¨)
 　　　　　　　　　.· ´¸.·*´¨) ¸.·*¨)
		  　　　　　　　　　　(¸.·´ (¸.·'* ☆
*/

#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <functional>
#include <complex>
#include <list>
#include <cassert>
#include <iomanip>
#include <set>
#include <stack>
#include <bitset>

////多倍長整数, cpp_intで宣言
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;

//#pragma gcc target ("avx2")
//#pragma gcc optimization ("Ofast")
//#pragma gcc optimization ("unroll-loops")
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define printynl(a) printf(a ? "yes\n" : "no\n")
#define printyn(a) printf(a ? "Yes\n" : "No\n")
#define printYN(a) printf(a ? "YES\n" : "NO\n")
#define printim(a) printf(a ? "possible\n" : "imposible\n")
#define printdb(a) printf("%.50lf\n", a) //少数出力
#define printLdb(a) printf("%.50Lf\n", a) //少数出力
#define printdbd(a) printf("%.16lf\n", a) //少数出力(桁少なめ)
#define prints(s) printf("%s\n", s.c_str()) //string出力
#define all(x) (x).begin(), (x).end()
#define deg_to_rad(deg) (((deg)/360.0L)*2.0L*PI)
#define rad_to_deg(rad) (((rad)/2.0L/PI)*360.0L)
#define Please return
#define AC 0
#define manhattan_dist(a, b, c, d) (abs(a - c) + abs(b - d)) /*(a, b) から (c, d) のマンハッタン距離 */
#define inf numeric_limits<double>::infinity();
#define linf numeric_limits<long double>::infinity()

using ll = long long;
using ull = unsigned long long;

constexpr int INF = 1073741823;
constexpr int MINF = -1073741823;
constexpr ll LINF = ll(4661686018427387903);
constexpr ll MOD = 1e9 + 7;
constexpr long double eps = 1e-6;
const long double PI = acosl(-1.0L);

using namespace std;

void scans(string& str) {
	char c;
	str = "";
	scanf("%c", &c);
	if (c == '\n')scanf("%c", &c);
	while (c != '\n' && c != -1 && c != ' ') {
		str += c;
		scanf("%c", &c);
	}
}

void scanc(char& str) {
	char c;
	scanf("%c", &c);
	if (c == -1)return;
	while (c == '\n') {
		scanf("%c", &c);
	}
	str = c;
}

double acot(double x) {
	return PI / 2 - atan(x);
}

ll LSB(ll n) { return (n & (-n)); }

template<typename T>
T chmin(T& a, const T& b) {
	if (a > b)a = b;
	return a;
}

template<typename T>
T chmax(T& a, const T& b) {
	if (a < b)a = b;
	return a;
}

/*-----------------------------------------ここからコード-----------------------------------------*/

void init(const vector<char>& c, vector<tuple<ll, ll, char>>& x, vector<tuple<ll, ll, char>>& y, const vector<tuple<ll, ll, char>>& a) {
	x = y = {};
	for (const auto& [xx, yy, uu] : a) {
		if (uu == c[0] or uu == c[1])x.push_back({ xx, yy, uu });
		else y.push_back({ xx, yy, uu });
	}
}

ll check(const vector<char>& c, const vector<tuple<ll, ll, char>>& x, const bool& xy) {
	ll ans = LINF;
	int m = x.size();
	if (xy) {
		rep(i, m - 1) {
			const auto& [x1, y1, u1] = x[i];
			const auto& [x2, y2, u2] = x[i + 1];
			if (u1 == c[0] and u2 == c[1] and x1 == x2)ans = min(ans, (y2 - y1) * 5ll);
		}
	}
	else {
		rep(i, m - 1) {
			const auto& [x1, y1, u1] = x[i];
			const auto& [x2, y2, u2] = x[i + 1];
			if (u1 == c[0] and u2 == c[1] and y1 == y2)ans = min(ans, (x2 - x1) * 5ll);
		}
	}
	return ans;
}

int main() {

	int n;
	scanf("%d", &n);
	vector<tuple<ll, ll, char>> a(n), x, y;
	for (auto& [xx, yy, uu] : a)scanf("%lld%lld%*c%c", &xx, &yy, &uu);
	init({ 'U', 'D' }, x, y, a);
	ll ans = LINF;
	auto f = [](const auto& p, const auto& q) {
		if (get<1>(p) == get<1>(q))return get<0>(p) < get<0>(q);
		else return get<1>(p) < get<1>(q);
	};
	sort(all(x));
	sort(all(y), f);
	ans = min({ ans, check({ 'U', 'D' }, x, true), check({'R', 'L'}, y, false) });
	for (auto& [xx, yy, uu] : a) {
		ll p = xx - yy, q= xx + yy;
		xx = p, yy = q;
	}
	init({ 'R', 'U' }, x, y, a);
	sort(all(x), f);
	sort(all(y), f);
	ans = min({ ans, check({ 'R', 'U' }, x, false), check({'D', 'L'}, y, false) });
	init({ 'R', 'D' }, x, y, a);
	sort(all(x));
	sort(all(y));
	ans = min({ ans, check({ 'R', 'D' }, x, true), check({'U', 'L'}, y, true) });
	if (ans == LINF)puts("SAFE");
	else printf("%lld\n", ans);

	Please AC;
}

Measured memory_bytes: 21788