import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto XYU = new int[][](N);
	foreach (i; 0..N)
	{
		XYU[i] = [RD!int, RD!int, 0];
		auto u = RD!char;
		if (u == 'U')
			XYU[i][2] = 0;
		else if (u == 'D')
			XYU[i][2] = 1;
		else if (u == 'L')
			XYU[i][2] = 2;
		else
			XYU[i][2] = 3;
	}
	XYU.sort!"a[0] == b[0] ? a[1] < b[1] : a[0] < b[0]"();

	auto bt = new int[][][](4, 400001);
	auto tb = new int[][][](4, 400001);
	auto line0 = new int[][](400001);
	auto line1 = new int[][](400001);
	foreach (i; 0..N)
	{
		auto x = XYU[i][0];
		auto y = XYU[i][1];
		auto u = XYU[i][2];
		auto d1 = x - y + 200000;
		auto d2 = x + y;
		bt[u][d1] ~= x;
		tb[u][d2] ~= x;
		if (u == 2)
			line0[y] ~= x;
		else if (u == 1)
			line1[x] ~= y;
	}

	long ans = long.max;
	foreach (i; 0..N)
	{
		auto x = XYU[i][0];
		auto y = XYU[i][1];
		auto u = XYU[i][2];
		auto d1 = x - y + 200000;
		auto d2 = x + y;
		bt[u][d1].popFront;
		tb[u][d2].popFront;
		if (u == 0)
		{
			{
				auto arr = bt[2][d1];
				if (!arr.empty)
				{
					auto x2 = arr.front;
					ans.chmin((x2 - x) * 10);
				}
			}
			{
				auto arr = line1[x];
				if (!arr.empty)
				{
					auto y2 = arr.front;
					ans.chmin((y2 - y) * 5);
				}
			}
		}
		else if (u == 1)
		{
			auto arr = tb[2][d2];
			if (!arr.empty)
			{
				auto x2 = arr.front;
				ans.chmin((x2 - x) * 10);
			}
			line1[x].popFront;
		}
		else if (u == 3)
		{
			{
				auto arr = bt[1][d1];
				if (!arr.empty)
				{
					auto x2 = arr.front;
					ans.chmin((x2 - x) * 10);
				}
			}
			{
				auto arr = tb[0][d2];
				if (!arr.empty)
				{
					auto x2 = arr.front;
					ans.chmin((x2 - x) * 10);
				}
			}
			{
				auto arr = line0[y];
				if (!arr.empty)
				{
					auto x2 = arr.front;
					ans.chmin((x2 - x) * 5);
				}
			}
		}
		else
		{
			line0[y].popFront;
		}
	}

	if (ans == long.max)
		writeln("SAFE");
	else
		writeln(ans);
	stdout.flush;
	debug readln;
}


Measured memory_bytes: 84688