#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
//int dx[4] = { 0,0,-1,1 }, dy[4] = { 1,-1,0,0 };

template<typename T>
vector<T> compress(vector<T> A) {
	sort(A.begin(), A.end());
	A.erase(unique(A.begin(), A.end()), A.end());
	return A;
}

void solve() {
	int N; cin >> N;
	vector<int>X(N), Y(N);
	vector<char>U(N);
	REP(i, N) {
		cin >> X[i] >> Y[i] >> U[i];
		assert(X[i] >= 0 && X[i] <= 200000 && Y[i] >= 0 && Y[i] <= 200000);
	}
	ll ans = LINF;
	//x+y=c
	{
		vector<int>v;
		REP(i, N) {
			v.push_back(X[i] + Y[i]);
		}
		v = compress(v);
		map<int, int>toid;
		int m = v.size();
		REP(i, m) {
			toid[v[i]] = i;
		}
		vector<vector<int>>vu(m), vr(m), vd(m), vl(m);
		REP(i, N) {
			int idx = toid[X[i] + Y[i]];
			if (U[i] == 'U')vu[idx].push_back(X[i]);
			else if (U[i] == 'R')vr[idx].push_back(X[i]);
			else if (U[i] == 'D')vd[idx].push_back(X[i]);
			else if (U[i] == 'L')vl[idx].push_back(X[i]);
		}
		REP(i, m) {
			vu[i].push_back(-1);
			vu[i].push_back(INF);
			vr[i].push_back(-1);
			vr[i].push_back(INF);
			vd[i].push_back(-1);
			vd[i].push_back(INF);
			vl[i].push_back(-1);
			vl[i].push_back(INF);
			VSORT(vu[i]); VSORT(vr[i]); VSORT(vd[i]); VSORT(vl[i]);
			//ur
			FOR(j,1,(int)vu[i].size()-1) {
				int x = vu[i][j];
				auto itr = lb(vr[i], x);
				//if ((*itr) != INF)chmin(ans, abs(x - (*itr))*10);
				itr--;
				if ((*itr) != -1)chmin(ans, abs(x - (*itr))*10);
			}
			//dl
			for (auto x : vd[i]) {
				if (x == -1 || x == INF)continue;
				auto itr = lb(vl[i], x);
				if ((*itr) != INF)chmin(ans, abs(x - (*itr))*10);
				if (*itr == -1)continue;
				itr--;
				//if ((*itr) != -1)chmin(ans, abs(x - (*itr))*10);
			}
		}
	}
	//print("a");
	//x-y=c
	{
		vector<int>v;
		REP(i, N) {
			v.push_back(X[i] - Y[i]);
		}
		v = compress(v);
		map<int, int>toid;
		int m = v.size();
		REP(i, m) {
			toid[v[i]] = i;
		}
		vector<vector<int>>vu(m), vr(m), vd(m), vl(m);
		REP(i, N) {
			int idx = toid[X[i] - Y[i]];
			if (U[i] == 'U')vu[idx].push_back(X[i]);
			else if (U[i] == 'R')vr[idx].push_back(X[i]);
			else if (U[i] == 'D')vd[idx].push_back(X[i]);
			else if (U[i] == 'L')vl[idx].push_back(X[i]);
		}
		REP(i, m) {
			vu[i].push_back(-1);
			vu[i].push_back(INF);
			vr[i].push_back(-1);
			vr[i].push_back(INF);
			vd[i].push_back(-1);
			vd[i].push_back(INF);
			vl[i].push_back(-1);
			vl[i].push_back(INF);
			VSORT(vu[i]); VSORT(vr[i]); VSORT(vd[i]); VSORT(vl[i]);
			//ul
			FOR(j, 1, (int)vu[i].size() - 1) {
				int x = vu[i][j];
				auto itr = lb(vl[i], x);
				if ((*itr) != INF)chmin(ans, abs(x - (*itr))*10);
				if (*itr == -1)continue;
				itr--;
				//if ((*itr) != -1)chmin(ans, abs(x - (*itr))*10);
			}
			//dr
			for (auto x : vd[i]) {
				if (x == -1 || x == INF)continue;
				auto itr = lb(vr[i], x);
				//if ((*itr) != INF)chmin(ans, abs(x - (*itr))*10);
				if (*itr == -1)continue;
				itr--;
				if ((*itr) != -1)chmin(ans, abs(x - (*itr))*10);
			}
			//rd

		}
	}
	//DEBUG(ans);
	//x=c
	{
		vector<int>v;
		REP(i, N) {
			v.push_back(X[i]);
		}
		v = compress(v);
		map<int, int>toid;
		int m = v.size();
		REP(i, m) {
			toid[v[i]] = i;
		}
		vector<vector<int>>vu(m), vr(m), vd(m), vl(m);
		REP(i, N) {
			int idx = toid[X[i]];
			if (U[i] == 'U')vu[idx].push_back(Y[i]);
			else if (U[i] == 'R')vr[idx].push_back(Y[i]);
			else if (U[i] == 'D')vd[idx].push_back(Y[i]);
			else if (U[i] == 'L')vl[idx].push_back(Y[i]);
		}
		REP(i, m) {
			vu[i].push_back(-1);
			vu[i].push_back(INF);
			vr[i].push_back(-1);
			vr[i].push_back(INF);
			vd[i].push_back(-1);
			vd[i].push_back(INF);
			vl[i].push_back(-1);
			vl[i].push_back(INF);
			VSORT(vu[i]); VSORT(vr[i]); VSORT(vd[i]); VSORT(vl[i]);
			//du
			FOR(j, 1, (int)vd[i].size() - 1) {
				int x = vd[i][j];
				auto itr = lb(vu[i], x);
				//if ((*itr) != INF)chmin(ans, abs(x - (*itr))*10);
				if (*itr == -1)continue;
				itr--;
				if ((*itr) != -1)chmin(ans, abs(x - (*itr)) * 5);
			}
			//ud
			for (auto x : vu[i]) {
				if (x == -1 || x == INF)continue;
				auto itr = lb(vd[i], x);
				if ((*itr) != INF)chmin(ans, abs(x - (*itr)) * 5);
				//itr--;
				//if ((*itr) != -1)chmin(ans, abs(x - (*itr))*10);
			}
		}
	}
	//DEBUG(ans);
	//y=c
	{
		vector<int>v;
		REP(i, N) {
			v.push_back(Y[i]);
		}
		v = compress(v);
		map<int, int>toid;
		int m = v.size();
		REP(i, m) {
			toid[v[i]] = i;
		}
		vector<vector<int>>vu(m), vr(m), vd(m), vl(m);
		REP(i, N) {
			int idx = toid[Y[i]];
			if (U[i] == 'U')vu[idx].push_back(X[i]);
			else if (U[i] == 'R')vr[idx].push_back(X[i]);
			else if (U[i] == 'D')vd[idx].push_back(X[i]);
			else if (U[i] == 'L')vl[idx].push_back(X[i]);
		}
		REP(i, m) {
			vu[i].push_back(-1);
			vu[i].push_back(INF);
			vr[i].push_back(-1);
			vr[i].push_back(INF);
			vd[i].push_back(-1);
			vd[i].push_back(INF);
			vl[i].push_back(-1);
			vl[i].push_back(INF);
			VSORT(vu[i]); VSORT(vr[i]); VSORT(vd[i]); VSORT(vl[i]);


			//lr
			FOR(j, 1, (int)vl[i].size() - 1) {
				int x = vl[i][j];
				auto itr = lb(vr[i], x);
				//if ((*itr) != INF)chmin(ans, abs(x - (*itr))*10);
				if (*itr == -1)continue;
				itr--;
				if ((*itr) != -1)chmin(ans, abs(x - (*itr)) * 5);
			}
			//rl
			for (auto x : vr[i]) {
				if (x == -1 || x == INF)continue;
				auto itr = lb(vl[i], x);
				if ((*itr) != INF)chmin(ans, abs(x - (*itr)) * 5);
				if (*itr == -1)continue;
				itr--;
				//if ((*itr) != -1)chmin(ans, abs(x - (*itr))*10);
			}
		}
	}
	if (ans == LINF)print("SAFE");
	else print(ans);
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q;
	//cin >> q;
	//while (q--)
	solve();

}


Measured memory_bytes: 66840