#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
//#define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
	for (int i = 0; i < A.size(); i++)
		os << A[i] << " ";
	os << endl;
	return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
	int N = A.size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < A[i].size(); j++)
			os << A[i][j] << " ";
		os << endl;
	}
	return os;
}

typedef pair< int, int > pii;
typedef long long ll;

struct edge {
	int from, to, d, c;
	edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
		from = _from;
		to = _to;
		d = _d;
		c = _c;
	}
	bool operator<(const edge &rhs) const {
		return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
	}
};
struct aabb {
	int x1, y1, x2, y2;
	aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
	int to, cap, rev, cost;
	flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
	if (x > y) {
		x = y;
		return true;
	}
	return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
	if (x < y) {
		x = y;
		return true;
	}
	return false;
}

struct initializer {
	initializer() {
		cout << fixed << setprecision(20);
	}
};
initializer _____;

int N, M, K, T, Q, H, W;
signed main() {
	cin >> N;
	vector< int > X(N), Y(N);
	vector< char > U(N);
	rep(i, N) cin >> X[i] >> Y[i] >> U[i];
	int ans = INF;
	vector< vector< pii > > xm(202020);
	rep(i, N) {
		pii p(Y[i], 0);
		if (U[i] == 'U')
			p.second = 1;
		if (U[i] == 'D')
			p.second = -1;
		xm[X[i]].push_back(p);
	}
	rep(i, xm.size()) {
		sort(xm[i].begin(), xm[i].end());
		int r = -INF;
		rep(j, xm[i].size()) {
			if (xm[i][j].second == 1) {
				r = xm[i][j].first;
			} else if (xm[i][j].second == -1) {
				chmin(ans, (xm[i][j].first - r) * 5);
			}
		}
	}
	vector< vector< pii > > ym(202020);
	rep(i, N) {
		pii p(X[i], 0);
		if (U[i] == 'R')
			p.second = 1;
		if (U[i] == 'L')
			p.second = -1;
		ym[Y[i]].push_back(p);
	}
	rep(i, ym.size()) {
		sort(ym[i].begin(), ym[i].end());
		int r = -INF;
		rep(j, ym[i].size()) {
			if (ym[i][j].second == 1) {
				r = ym[i][j].first;
			} else if (ym[i][j].second == -1) {
				chmin(ans, (ym[i][j].first - r) * 5);
			}
		}
	}
	vector< vector< pair< int, char > > > xpym(402020), xmym(402020);
	rep(i, N) {

		xpym[X[i] + Y[i]].push_back(make_pair(X[i], U[i]));
		xmym[X[i] - Y[i] + 200000].push_back(make_pair(X[i], U[i]));
	}
	rep(i, xpym.size()) {
		sort(xpym[i].begin(), xpym[i].end());
		int r = -INF, d = -INF;
		for (auto p : xpym[i]) {
			if (p.second == 'R') {
				r = p.first;
			} else if (p.second == 'D') {
				d = p.first;
			} else if (p.second == 'U') {
				chmin(ans, (p.first - r) * 10);
			} else {
				chmin(ans, (p.first - d) * 10);
			}
		}
	}
	rep(i, xmym.size()) {
		sort(xmym[i].begin(), xmym[i].end());
		int u = -INF, r = -INF;
		for (auto p : xmym[i]) {
			if (p.second == 'R') {
				r = p.first;
			} else if (p.second == 'U') {
				u = p.first;
			} else if (p.second == 'L') {
				chmin(ans, (p.first - u) * 10);
			} else {
				chmin(ans, (p.first - r) * 10);
			}
		}
	}
	if (ans == INF) {
		cout << "SAFE" << endl;
	} else
		cout << ans << endl;
	return 0;
}

Measured memory_bytes: 56492