#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgset(st) cerr << #st << ":"<<endl; for (auto i = st.begin(); i != st.end(); ++i) { cerr << *i <<" ";}cerr<<endl;
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout<<a<<endl
#define out2(a,b) cout<<a<<" "<<b<<endl
#define vout(v) rep(i,v.size()){cout<<v[i]<<" ";}cout<<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,v.size())i>>v[j];return i;}

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len=v.size();
    for(int i=0; i<len; ++i) {
        s<<v[i];
        if(i<len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len=vv.size();
    for(int i=0; i<len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

int solve(){
    ll n;
    cin>>n;
    Vec x(n);
    Vec y(n);
    Vc d(n);
    rep(i,n){
        cin>>x[i]>>y[i]>>d[i];
    }
    ll D = 1000000;
    ll ans = INF;

    //縦横
    {
        map<ll,vector<ll>> lower;
        map<ll,vector<ll>> upper;
        rep(i,n){
            //縦
            if(d[i]=='U'){
                lower[x[i]].pb(y[i]);
            }
            if(d[i]=='D'){
                upper[x[i]].pb(y[i]);
            }

            //横
            if(d[i]=='R'){
                lower[y[i]+D].pb(x[i]);
            }
            if(d[i]=='L'){
                upper[y[i]+D].pb(x[i]);
            }
        }

        Each(p, lower){
            ll type = p.fi;
            Vec &v = p.se;
            if(upper.count(type)==0)continue;
            Vec opp = upper[type];
            sort(ALL(opp));
            Each(criteria, v){
                if(lower_bound(ALL(opp),criteria)!=opp.end()){
                    auto itr = upper_bound(ALL(opp),criteria);
                    chmin(ans, (*itr - criteria)*10/2);
                }
            }
        }
    }

    //y=x+k
    {
        map<ll,vector<ll>> lower;
        map<ll,vector<ll>> upper;
        rep(i,n){
            if(d[i]=='U'){
                lower[y[i]-x[i]+D].pb(x[i]);
            }
            if(d[i]=='L'){
                upper[y[i]-x[i]+D].pb(x[i]);
            }

            if(d[i]=='R'){
                lower[y[i]-x[i]].pb(x[i]);
            }
            if(d[i]=='D'){
                upper[y[i]-x[i]].pb(x[i]);
            }
        }

        Each(p, lower){
            ll type = p.fi;
            Vec &v = p.se;
            Vec opp = upper[type];
            sort(ALL(opp));
            Each(criteria, v){
                if(lower_bound(ALL(opp),criteria)!=opp.end()){
                    auto itr = upper_bound(ALL(opp),criteria);
                    chmin(ans, (*itr - criteria)*10);
                }
            }
        }
    }

    //y=-x+k
    {
        map<ll,vector<ll>> lower;
        map<ll,vector<ll>> upper;
        rep(i,n){
            if(d[i]=='R'){
                lower[y[i]+x[i]+D].pb(x[i]);
            }
            if(d[i]=='U'){
                upper[y[i]+x[i]+D].pb(x[i]);
            }

            if(d[i]=='D'){
                lower[y[i]+x[i]].pb(x[i]);
            }
            if(d[i]=='L'){
                upper[y[i]+x[i]].pb(x[i]);
            }
        }
        Each(p, lower){
            ll type = p.fi;
            Vec &v = p.se;
            Vec opp = upper[type];
            sort(ALL(opp));
            Each(criteria, v){
                if(lower_bound(ALL(opp),criteria)!=opp.end()){
                    auto itr = upper_bound(ALL(opp),criteria);
                    chmin(ans, (*itr - criteria)*10);
                }
            }
        }
    }

    if(ans==INF){
        cout<<"SAFE"<<endl;
    }else{
        out(ans);
    }
    return  0;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}


Measured memory_bytes: 43576