#include"bits/stdc++.h"
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vvl=vector<vl>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
#define pqueue priority_queue
template<typename T>constexpr auto inf=numeric_limits<T>::max()/2;constexpr int INF=inf<int>,MOD=1000000007;constexpr ll LINF=inf<ll>;
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...)_ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n)for(int i=n-1;i>=0;--i)
#define REPA(i,v)REP(i,(v).size())
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
#define bit(n)(1ll<<(n))
#define F first
#define S second
#define endl '\n'
void _print(ostream&){}template<class T,class...U>void _print(ostream&s,const T&t,const U&...u){s<<t<<(sizeof...(u)?' ':'\n');_print(s,u...);}
template<class...T>void print(const T&...t){_print(cout,t...);}template<class...T>void dprint(const T&...t){_print(cerr,t...);}
#ifndef LOCAL
struct osd{template<class T>osd&operator<<(const T&t){return*this;}};osd cer_;
#define dprint(...)
#define cerr cer_
#endif
#define dbg(x) dprint("@l",__LINE__,':',#x,'=',x)
#define cho(n,a,b)print((n)?a:b)
void YES(int n){cho(n,"YES","NO");}void Yes(int n){cho(n,"Yes","No");}void Poss(int n){cho(n,"Possible","Impossible");}
template<class T, class U>bool chmax(T&a,const U&b){bool x=a<b;x?a=b:b;return x;}template<class T, class U>bool chmin(T&a,const U&b){bool x=a>b;x?a=b:b;return x;}
template<class T, class U>auto max(const T&a,const U&b){return a<b?b:a;}template<class T, class U>auto min(const T&a,const U&b){return a<b?a:b;}
template<class T,class U>ostream&operator<<(ostream&o,const pair<T,U>&p){return o<<p.F<<' '<<p.S;}template<class T,class U>istream&operator>>(istream&i,pair<T,U>&p){return i>>p.F>>p.S;}
template<class T>class iterable{static false_type c(string v);template<class U>static auto c(U v)->decltype(all(v),true_type());static false_type c(...);public:const static bool value=decltype(c(declval<T>()))::value;};
template<class T,enable_if_t<iterable<T>::value,int> =0>ostream&operator<<(ostream&o,const T&v){for(auto&&i:v)o<<i<<' ';return o;}
template<class T>istream&operator>>(istream&i,vector<T>&v){for(T&j:v)i>>j;return i;}template<class T>vector<T>&operator<<(vector<T>&v,const T&t){v.push_back(t);return v;}
template<class T,class U>queue<T,U>&operator<<(queue<T,U>&v, const T&t){v.push(t);return v;}template<class T,class U>queue<T,U>&operator>>(queue<T,U>&v, T&t){t=v.front();v.pop();return v;}
template<class T,class U,class V>pqueue<T,U,V>&operator<<(pqueue<T,U,V>&v, const T&t){v.push(t);return v;}template<class T,class U,class V>pqueue<T,U,V>&operator>>(pqueue<T,U,V>&v, T&t){t=v.front();v.pop();return v;}
template<class T,class U>stack<T,U>&operator<<(stack<T,U>&v, const T&t){v.push(t);return v;}template<class T,class U>stack<T,U>&operator>>(stack<T,U>&v, T&t){t=v.front();v.pop();return v;}
template<class T,class U,class V>set<T,U,V>&operator<<(set<T,U,V>&v,const T&t){v.insert(t);return v;}template<class T,class U,class V>multiset<T,U,V>&operator<<(multiset<T,U,V>&v,const T&t){v.insert(t);return v;}
template<class T,enable_if_t<is_integral<T>::value,int> =0>T mod(T a, T b){if(a>0)return a%b;return b-(-a%b);}template<class T,enable_if_t<is_floating_point<T>::value,int> =0>T mod(T a, T b){if(a>0)return fmod(a,b);return b-fmod(-a,b);}
template<class T,class U>pair<T,U>&operator+=(pair<T,U>&a, const pair<T,U>&b){a.F+=b.F;a.S+=b.S;return a;}template<class T,class U>pair<T,U> operator+(const pair<T,U>&a, const pair<T,U>&b){auto r=a;return r+=b;}
template<class T,class U>pair<T,U>&operator-=(pair<T,U>&a, const pair<T,U>&b){a.F-=b.F;a.S-=b.S;return a;}template<class T,class U>pair<T,U> operator-(const pair<T,U>&a, const pair<T,U>&b){auto r=a;return r-=b;}
template<class T,class U>pair<T,U> operator-(const pair<T,U>&a){return {-a.F, -a.S};}
template<class T,class U>double norm(const pair<T,U>&p){return norm(p.F)+norm(p.S);}template<class T,class U>double abs(const pair<T,U>&p){return sqrt(norm(p));}

map<int, set<int>> y_u, y_d, x_l, x_r; // 軸と平行
map<int, set<int>> p_u_x, p_u_y, p_d_x, p_d_y, p_l_x, p_l_y, p_r_x, p_r_y; // x+yが等しい
map<int, set<int>> n_u_x, n_u_y, n_d_x, n_d_y, n_l_x, n_l_y, n_r_x, n_r_y; // x-yが等しい

map<int, set<int>>& select_dir(char dir, map<int, set<int>>& u, map<int, set<int>>& d, map<int, set<int>>& l, map<int, set<int>>& r){
    switch(dir){
        case 'U':
            return u;
        case 'D':
            return d;
        case 'L':
            return l;
        case 'R':
            return r;
    }
}

map<int, set<int>>& a_x(char dir) {return select_dir(dir, y_u, y_d, x_l, x_r);}


map<int, set<int>>& p_x_x(char dir) {return select_dir(dir, p_u_x, p_d_x, p_l_x, p_r_x);}
map<int, set<int>>& p_x_y(char dir) {return select_dir(dir, p_u_y, p_d_y, p_l_y, p_r_y);}
map<int, set<int>>& n_x_x(char dir) {return select_dir(dir, n_u_x, n_d_x, n_l_x, n_r_x);}
map<int, set<int>>& n_x_y(char dir) {return select_dir(dir, n_u_y, n_d_y, n_l_y, n_r_y);}


int main(){
    cin.tie(0);ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(10);
    int n;
    cin>>n;

    
    REP(i,n) {
        int x,y;
        char u;
        cin>>x>>y>>u;
        if(u == 'U' || u == 'D') {
            a_x(u)[x] << y;
        }else{
            a_x(u)[y] << x;
        }

        p_x_x(u)[x+y] << x;p_x_y(u)[x+y] << y;
        n_x_x(u)[x-y] << x;n_x_y(u)[x-y] << y;
    }

    // sort(all(y_u));
    // sort(all(y_d));
    // sort(all(x_l));
    // sort(all(x_r));
    // sort(all(p_u_x));sort(all(p_u_y));
    // sort(all(p_d_x));sort(all(p_d_y));
    // sort(all(p_l_x));sort(all(p_l_y));
    // sort(all(p_r_x));sort(all(p_r_y));
    // sort(all(n_u_x));sort(all(n_u_y));
    // sort(all(n_d_x));sort(all(n_d_y));
    // sort(all(n_l_x));sort(all(n_l_y));
    // sort(all(n_r_x));sort(all(n_r_y));

    int mi = INF; // ans


    for (const auto&m : y_u) { // v^
        for (const auto&y: m.S) {
            const auto iter = y_d[m.F].lower_bound(y);
            if(iter == y_d[m.F].end()) continue;
            chmin(mi, (*iter - y) * 5);
        }
    }

    for (const auto&m : x_r) { // ><
        for (const auto&x: m.S) {
            const auto iter = x_l[m.F].lower_bound(x);
            if(iter == x_l[m.F].end()) continue;
            chmin(mi, (*iter - x) * 5);
        }
    }

    for (const auto&m : p_u_y) { // >^
        for (const auto&y: m.S) {
            const auto iter = p_r_y[m.F].lower_bound(y);
            if(iter == p_r_y[m.F].end()) continue;
            chmin(mi, (*iter - y) * 10);
        }
    }
    for (const auto&m : p_d_x) { // v<
        for (const auto&x: m.S) {
            const auto iter = p_l_x[m.F].lower_bound(x);
            if(iter == p_l_x[m.F].end()) continue;
            chmin(mi, (*iter - x) * 10);
        }
    }
    
    for (const auto&m : n_u_y) { // ^<
        for (const auto&y: m.S) {
            const auto iter = n_l_y[m.F].lower_bound(y);
            if(iter == n_l_y[m.F].end()) continue;
            chmin(mi, (*iter - y) * 10);
        }
    }
    for (const auto&m : n_r_x) { // >v
        for (const auto&x: m.S) {
            const auto iter = n_d_x[m.F].lower_bound(x);
            if(iter == n_d_x[m.F].end()) continue;
            chmin(mi, (*iter - x) * 10);
        }
    }
    
    if(mi == INF) {
        print("SAFE");
    }else{
        print(mi);
    }
    
}


Measured memory_bytes: 170656