#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll inf=1e9+7;
const ll mod=998244353;
signed main(){
    ll n;cin>>n;
    map<ll,vector<pll> >x,y;
    map<ll,vector<pll> >xpy;
    map<ll,vector<pll> >ymx;
    rep(i,n){
        ll a,b;cin>>a>>b;
        char c;cin>>c;
        ll d=0;
        if(c=='R')d=0;
        if(c=='U')d=1;
        if(c=='L')d=2;
        if(c=='D')d=3;

        x[a].pb(mp(b,d));
        y[b].pb(mp(a,d));
        xpy[a+b].pb(mp(a,d));
        ymx[b-a+200000].pb(mp(a,d));
    }
    ll ans=inf*inf;
    for(auto s:x){
        ll u=-1,d=-1;
        ll i=s.first;
        sort(all(x[i]));
        for(auto e:x[i]){
            if(e.second==1)d=e.first;
            if(e.second==3)u=e.first;
            if(u>=0&&d>=0&&u-d>=0){
                ans=min(ans,(u-d)*5);
            }
        }
    }
    for(auto s:y){
        ll l=-1,r=-1;
        ll i=s.first;
        sort(all(y[i]));
        for(auto e:y[i]){
            if(e.second==0)l=e.first;
            if(e.second==2)r=e.first;
            if(l>=0&&r>=0&&r-l>=0){
                ans=min(ans,(r-l)*5);
            }
        }
    }
    for(auto s:xpy){
        ll l=-1,r=-1,u=-1,d=-1;
        ll i=s.first;
        sort(all(xpy[i]));
        for(auto e:xpy[i]){
            if(e.second==0)l=e.first;
            if(e.second==2)r=e.first;
            if(e.second==1)d=e.first;
            if(e.second==3)u=e.first;
            if(l>=0&&d>=0&&d>=l)ans=min(ans,(d-l)*10);
            if(r>=0&&u>=0&&r>=u)ans=min(ans,(r-u)*10);
        }
    }
    for(auto s:ymx){
        ll l=-1,r=-1,u=-1,d=-1;
        ll i=s.first;
        sort(all(ymx[i]));
        for(auto e:ymx[i]){
            if(e.second==0)l=e.first;
            if(e.second==2)r=e.first;
            if(e.second==1)d=e.first;
            if(e.second==3)u=e.first;
            if(l>=0&&u>=0&&u>=l)ans=min(ans,(u-l)*10);
            if(r>=0&&d>=0&&r>=d)ans=min(ans,(r-d)*10);
        }
    }
    if(ans==inf*inf){
        cout<<"SAFE"<<endl;
    }else{
        cout<<ans<<endl;
    }
}
#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	if (!b)return T(1);
	if (b & 1)return mypow(a, b - 1) * a;
	T memo = mypow(a, b >> 1);
	return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
	if (!b)return 1;
	if (b & 1)return modpow(a, b - 1, m) * a % m;
	lint memo = modpow(a, b >> 1, m);
	return memo * memo % m;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size() - 1)std::cout << vec[i] << " ";
	std::cout << vec.back() << std::endl;
}
template<typename T>
void printArray(T l, T r) {
	T rprev = r;
	rprev--;
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
#line 2 "main.cpp"
int n,x[200010],y[200010];
char u[200010];
std::vector<std::pair<int,char>> vec[4][400010];
int main(){
	std::cin>>n;
	rep(i,n){
		std::cin>>x[i]>>y[i]>>u[i];
		vec[0][x[i]].emplace_back(y[i],u[i]);
		vec[1][y[i]].emplace_back(x[i],u[i]);
		vec[2][x[i]+y[i]].emplace_back(x[i],u[i]);
		vec[3][x[i]-y[i]+200000].emplace_back(x[i],u[i]);
	}
	rep(i,4){
		rep(j,400001)std::sort(all(vec[i][j]));
	}
	int ans=INF;
	rep(i,400001){
		int now=-1;
		for(const auto& j:vec[0][i]){
			if(j.second=='U')now=j.first;
			if(j.second=='D'&&now!=-1)chmin(ans,(j.first-now)*5);
		}
	}
	rep(i,400001){
		int now=-1;
		for(const auto& j:vec[1][i]){
			if(j.second=='R')now=j.first;
			if(j.second=='L'&&now!=-1)chmin(ans,(j.first-now)*5);
		}
	}
	rep(i,400001){
		int rnow=-1,dnow=-1;
		for(const auto& j:vec[2][i]){
			if(j.second=='R')rnow=j.first;
			if(j.second=='D')dnow=j.first;
			if(j.second=='U'&&rnow!=-1)chmin(ans,(j.first-rnow)*10);
			if(j.second=='L'&&dnow!=-1)chmin(ans,(j.first-dnow)*10);
		}
	}
	rep(i,400001){
		int rnow=-1,unow=-1;
		for(const auto& j:vec[3][i]){
			if(j.second=='R')rnow=j.first;
			if(j.second=='U')unow=j.first;
			if(j.second=='L'&&unow!=-1)chmin(ans,(j.first-unow)*10);
			if(j.second=='D'&&rnow!=-1)chmin(ans,(j.first-rnow)*10);
		}
	}
	if(ans==INF)puts("SAFE");
	else std::cout<<ans<<std::endl;
	return 0;
}