#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T> using PriorityQ = priority_queue<T, vector<T>, greater<T> >;
#define REP(i, a, n) for(LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for(LL i = (LL)(n) - 1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP { cin.tie(NULL); ios::sync_with_stdio(false); }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U> istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U> ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N> void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N> void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template <class T> T Next() { T buf; cin >> buf; return buf; }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "BIT.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "Factorization.h"
#include "FFT.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "Interpolation.h"
#include "IntMod.h"
#include "KDTree.h"
#include "LazySegmentTree.h"
#include "LIS.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>>(istream& ist, __int128& val) { LL tmp; ist >> tmp; val = tmp; return ist; }
ostream& operator<<(ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif



int N;
int X[200000];
int Y[200000];
char C[200000];

LL cat(vector<PP> v) {
	sort(v.begin(), v.end());

	LL mn = INFLL;
	LL prev = -INFLL;
	for (auto&& p : v) {
		if (p.second == 0) {
			prev = p.first;
		} else {
			if (prev != -INFLL) {
				mn = min(mn, p.first - prev);
			}
		}
	}
	return mn == INFLL ? INFLL : 10 * mn;
}

LL sub(const vector<PP>& v, vector<bool>& up) {
	map<int, vector<PP>> mp;
	REP(i, 0, v.size()) {
		mp[v[i].first + v[i].second].push_back(PP(v[i].first, up[i]));
	}

	LL mn = INFLL;
	for (auto&& p : mp) {
		mn = min(mn, cat(p.second));
	}
	return mn;
}

LL mouse(vector<PP> v) {
	sort(v.begin(), v.end());

	LL mn = INFLL;
	LL prev = -INFLL;
	for (auto&& p : v) {
		if (p.second == 0) {
			prev = p.first;
		} else {
			if (prev != -INFLL) {
				mn = min(mn, p.first - prev);
			}
		}
	}
	return mn == INFLL ? INFLL : 5 * mn;
}

LL dog() {
	map<int, vector<PP>> mp;
	map<int, vector<PP>> mq;
	REP(i, 0, N) {
		if (C[i] == 'U') {
			mp[X[i]].push_back(PP(Y[i], 0));
		}
		if (C[i] == 'D') {
			mp[X[i]].push_back(PP(Y[i], 1));
		}
	}
	REP(i, 0, N) {
		if (C[i] == 'R') {
			mq[Y[i]].push_back(PP(X[i], 0));
		}
		if (C[i] == 'L') {
			mq[Y[i]].push_back(PP(X[i], 1));
		}
	}

	LL mn = INFLL;
	for (auto& p : mp) {
		mn = min(mn, mouse(p.second));
	}
	for (auto& p : mq) {
		mn = min(mn, mouse(p.second));
	}
	return mn;
}

int main() {
	cin >> N;
	REP(i, 0, N) cin >> X[i] >> Y[i] >> C[i];
	
	LL mn = dog();

	char cs[4][2] = {
		{'R', 'U'},
		{'U', 'L'},
		{'L', 'D'},
		{'D', 'R'}
	};

	REP(z, 0, 4) {
		vector<PP> v;
		vector<bool> b;
		REP(i, 0, N) {
			REP(k, 0, 2) {
				if (C[i] == cs[z][k]) {
					v.push_back(PP(X[i], Y[i]));
					b.push_back(k);
				}
			}
		}
		mn = min(mn, sub(v, b));

		REP(i, 0, N) {
			int x = X[i];
			int y = Y[i];
			X[i] = y;
			Y[i] = -x;
		}
	}

	if (mn == INFLL) {
		cout << "SAFE" << endl;
	} else {
		cout << mn << endl;
	}
	return 0;
}



Measured memory_bytes: 31036