#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
ll n;
vi x,y;
vp z;
ll ans=inf;
ll getid(int i){return (z[i].fi+z[i].se+1)/2;}
void d1(){
    vp r;
    rep(i,n)if(z[i].fi!=0)r.pb(y[i],i);
    sort(all(r));
    int w=0;
    while(w<r.size()){
        vp v(1);v[0]=P(x[r[w].se],z[r[w].se].fi);
        while(w+1<r.size()&&r[w].fi==r[w+1].fi){
            v.pb(x[r[w+1].se],z[r[w+1].se].fi);w++;
        }sort(all(v));
        rep(i,v.size()-1){
            if(v[i].se==1&&v[i+1].se==-1)chmin(ans,(v[i+1].fi-v[i].fi)*5);
        }
        w++;
    }
}
void d2(){
    vp r;
    rep(i,n)r.pb(x[i]+y[i],i);
    sort(all(r));
    int w=0;
    while(w<r.size()){
        vector<vp> v(3);v[getid(r[w].se)].pb(x[r[w].se],z[r[w].se].fi);
        while(w+1<r.size()&&r[w].fi==r[w+1].fi){
            v[getid(r[w+1].se)].pb(x[r[w+1].se],z[r[w+1].se].fi);w++;
        }rep(t,2)sort(all(v[t]));
        rep(t,2)rep(i,v[t].size()-1){
            if(((!t)&&v[t][i].se==0&&v[t][i+1].se==-1)||((t)&&v[t][i].se==1&&v[t][i+1].se==0))chmin(ans,(v[t][i+1].fi-v[t][i].fi)*10);
        }
        w++;
    }
}
void s1(){
    rep(i,n){
        swap(x[i],y[i]);x[i]*=-1;
        swap(z[i].fi,z[i].se);z[i].fi*=-1;
    }
}
void s2(){
    rep(i,n)x[i]*=-1;
    rep(i,n)z[i].fi*=-1;
}
int main(){
    cin>>n;
    x=vi(n);y=vi(n);z=vp(n);
    rep(i,n){
        char c;cin>>x[i]>>y[i]>>c;
        if(c=='R')z[i].fi=1;
        if(c=='L')z[i].fi=-1;
        if(c=='U')z[i].se=1;
        if(c=='D')z[i].se=-1;
    }
    rep(i,8){
        d1();d2();s1();
    }
    s2();
    rep(i,8){
        d1();d2();s1();
    }
    if(ans!=inf)out(ans);
    else out("SAFE");
}


Measured memory_bytes: 21744