//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using V = vector<T>;
template<typename T> using VV = vector<vector<T>>;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define siz(v) (ll)(v).size()
#define rep(i,a,n) for(ll i=a;i<(ll)(n);++i)
#define repr(i,a,n) for(ll i=n-1;(ll)a<=i;--i)
#define ENDL '\n'
typedef pair<int,int> Pi;
typedef pair<ll,ll> PL;
constexpr ll mod = 1000000007;
constexpr ll INF = 1000000099;
constexpr ll LINF = (ll)(1e18 +99);
const vector<ll> dx={-1,1,0,0},dy={0,0,-1,1};
template<typename T,typename U> inline bool chmin(T& t, const U& u){if(t>u){t=u;return 1;}return 0;}
template<typename T,typename U> inline bool chmax(T& t, const U& u){if(t<u){t=u;return 1;}return 0;}
template<typename T> inline T gcd(T a,T b){return b?gcd(b,a%b):a;}

template<typename T,typename Y> inline T mpow(T a, Y n) {
  T res = 1;
  for(;n;n>>=1) {
    if (n & 1) res = res * a;
    a = a * a;
  }
  return res;
}

template<typename T,typename Y>
ostream& operator<<(ostream& os,const pair<T,Y>& p){
  return os<<"{"<<p.fs<<","<<p.sc<<"}";
}
template<typename T> ostream& operator<<(ostream& os,const V<T>& v){
  os<<"{";
  for(auto e:v)os<<e<<",";
  return os<<"}";
}
template<typename ...Args>
void debug(Args&... args){
  for(auto const& x:{args...}){
    cerr<<x<<' ';
  }
  cerr<<ENDL;
}



signed main(){
  cin.tie(0);cerr.tie(0);ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(20);
  ll n,ans=INF;cin>>n;
  VV<pair<ll,char>> pls(600010,V<pair<ll,char>>(0)),mns=pls;
  VV<pair<ll,char>> xs(200010,V<pair<ll,char>>(0)),ys=xs;

  rep(i,0,n){
    ll x,y;char u;cin>>x>>y>>u;
    if(u=='U' || u=='D')xs[x].eb(y,u);
    else ys[y].eb(x,u);
    y+=200000;
    pls[y-x].eb(x,u);
    mns[y+x].eb(x,u);
  }
  rep(i,0,600005){
    sort(all(pls[i]));
    sort(all(mns[i]));
  }
  rep(i,0,200005){
    sort(all(xs[i]));
    sort(all(ys[i]));
  }

  rep(i,0,200005){
    bool uflag=false;
    ll upos;
    rep(j,0,siz(xs[i])){
      if(xs[i][j].sc=='U'){
        uflag=true;
        upos=xs[i][j].fs;
      }
      else if(uflag){
        chmin(ans,5*(xs[i][j].fs-upos));
      }
    }
  }
  rep(i,0,200005){
    bool rflag=false;
    ll rpos;
    rep(j,0,siz(ys[i])){
      if(ys[i][j].sc=='R'){
        rflag=true;
        rpos=ys[i][j].fs;
      }
      else if(rflag){
        chmin(ans,5*(ys[i][j].fs-rpos));
      }
    }
  }

  rep(i,0,600005){
    bool rflag=false;
    ll rpos;
    bool uflag=false;
    ll upos;
    rep(j,0,siz(pls[i])){
      if(pls[i][j].sc=='R'){
        rflag=true;
        rpos=pls[i][j].fs;
      }else if(pls[i][j].sc=='U'){
        uflag=true;
        upos=pls[i][j].fs;
      }else if(rflag && pls[i][j].sc=='D'){
        chmin(ans,10*(pls[i][j].fs-rpos));
      }else if(uflag && pls[i][j].sc=='L'){
        chmin(ans,10*(pls[i][j].fs-upos));
      }
    }
  }


  rep(i,0,600005){
    bool rflag=false;
    ll rpos;
    bool dflag=false;
    ll dpos;
    rep(j,0,siz(mns[i])){
      if(mns[i][j].sc=='R'){
        rflag=true;
        rpos=mns[i][j].fs;
      }else if(mns[i][j].sc=='D'){
        dflag=true;
        dpos=mns[i][j].fs;
      }else if(rflag && mns[i][j].sc=='U'){
        chmin(ans,10*(mns[i][j].fs-rpos));
      }else if(dflag && mns[i][j].sc=='L'){
        chmin(ans,10*(mns[i][j].fs-dpos));
      }
    }
  }

  if(ans>=INF)cout<<"SAFE"<<ENDL;
  else cout<<ans<<ENDL;

}
//! ( . _ . ) ! 
//CHECK overflow,vector_size,what to output?

Measured memory_bytes: 59108