#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

void topcoder(vector<int>& v){
  string s;
  while(1){
    cin>>s;
    int i=s[0]=='{',x=0;
    while(s[i]>='0'&&s[i]<='9'){
      x=x*10+s[i]-'0';
      ++i;
    }
    v.eb(x);
    if(s[i]=='}')break;
  }
}
void topcoder(string& s){
  string t;
  cin>>t;
  int i=1;
  while(t[i]!='"'){
    s+=t[i++];
  }
}

ll N,M,K,H,W,A,B,C,D;
string s,t;
struct edge{
  int x,y,d;
};
int main(){
  // startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j,back,ans=inf;
  cin>>N;
  vector<edge> v(N),ch;
  rep(i,N){
    cin>>v[i].x>>v[i].y>>s;
    v[i].d=(s[0]=='U')+(s[0]=='D')*2+(s[0]=='L')*3+(s[0]=='R')*4;
  }
  //eq x
  sort(all(v),[](auto l,auto r){
    if(l.x!=r.x)return l.x<r.x;
    else return l.y<r.y;
  });
  back=-inf;
  rep(i,N){
    if(v[i].d>=3)continue;
    if(back!=v[i].x){
      if(ch.size()>=2){
        j=-inf;
        for(auto now:ch){
          if(now.d==1){
            j=now.y;
          }else{
            if(j!=-inf)chmin(ans,(now.y-j)*5);
          }
        }
      }
      ch.clear();
      back=v[i].x;
    }
    ch.eb(v[i]);
  }
  if(ch.size()>=2){
    j=-inf;
    for(auto now:ch){
      if(now.d==1){
        j=now.y;
      }else{
        if(j!=-inf)chmin(ans,(now.y-j)*5);
      }
    }
  }
  ch.clear();
  //eq y
  sort(all(v),[](auto l,auto r){
    if(l.y!=r.y)return l.y<r.y;
    else return l.x<r.x;
  });
  back=-inf;
  rep(i,N){
    if(v[i].d<3)continue;
    if(back!=v[i].y){
      if(ch.size()>=2){
        j=-inf;
        for(auto now:ch){
          if(now.d==4){
            j=now.x;
          }else{
            if(j!=-inf)chmin(ans,(now.x-j)*5);
          }
        }
      }
      ch.clear();
      back=v[i].y;
    }
    ch.eb(v[i]);
  }
  if(ch.size()>=2){
    j=-inf;
    for(auto now:ch){
      if(now.d==4){
        j=now.x;
      }else{
        if(j!=-inf)chmin(ans,(now.x-j)*5);
      }
    }
  }
  ch.clear();

  //eq x+y collision R&U
  sort(all(v),[](auto l,auto r){
    if(l.x+l.y!=r.x+r.y)return l.x+l.y<r.x+r.y;
    else return l.x<r.x;
  });
  back=-inf;
  rep(i,N){
    if(v[i].d==2||v[i].d==3)continue;
    if(back!=v[i].x+v[i].y){
      if(ch.size()>=2){
        j=-inf;
        for(auto now:ch){
          if(now.d==4){
            j=now.x;
          }else{
            if(j!=-inf)chmin(ans,(now.x-j)*10);
          }
        }
      }
      ch.clear();
      back=v[i].x+v[i].y;
    }
    ch.eb(v[i]);
  }
  if(ch.size()>=2){
    j=-inf;
    for(auto now:ch){
      if(now.d==4){
        j=now.x;
      }else{
        if(j!=-inf)chmin(ans,(now.x-j)*10);
      }
    }
  }
  ch.clear();

  //eq x+y collision D&L
  back=-inf;
  rep(i,N){
    if(v[i].d==1||v[i].d==4)continue;
    if(back!=v[i].x+v[i].y){
      if(ch.size()>=2){
        j=-inf;
        for(auto now:ch){
          if(now.d==2){
            j=now.x;
          }else{
            if(j!=-inf)chmin(ans,(now.x-j)*10);
          }
        }
      }
      ch.clear();
      back=v[i].x+v[i].y;
    }
    ch.eb(v[i]);
  }
  if(ch.size()>=2){
    j=-inf;
    for(auto now:ch){
      if(now.d==2){
        j=now.x;
      }else{
        if(j!=-inf)chmin(ans,(now.x-j)*10);
      }
    }
  }
  ch.clear();

  //eq x-y collision L&U
  sort(all(v),[](auto l,auto r){
    if(l.x-l.y!=r.x-r.y)return l.x-l.y<r.x-r.y;
    else return l.x<r.x;
  });
  back=-inf;
  rep(i,N){
    if(~v[i].d&1)continue;
    if(back!=v[i].x-v[i].y){
      if(ch.size()>=2){
        j=-inf;
        for(auto now:ch){
          if(now.d==1){
            j=now.x;
          }else{
            if(j!=-inf)chmin(ans,(now.x-j)*10);
          }
        }
      }
      ch.clear();
      back=v[i].x-v[i].y;
    }
    ch.eb(v[i]);
  }
  if(ch.size()>=2){
    j=-inf;
    for(auto now:ch){
      if(now.d==1){
        j=now.x;
      }else{
        if(j!=-inf)chmin(ans,(now.x-j)*10);
      }
    }
  }
  ch.clear();

  //eq x-y collision R&D
  back=-inf;
  rep(i,N){
    if(v[i].d&1)continue;
    if(back!=v[i].x-v[i].y){
      if(ch.size()>=2){
        j=-inf;
        for(auto now:ch){
          if(now.d==4){
            j=now.x;
          }else{
            if(j!=-inf)chmin(ans,(now.x-j)*10);
          }
        }
      }
      ch.clear();
      back=v[i].x-v[i].y;
    }
    ch.eb(v[i]);
  }
  if(ch.size()>=2){
    j=-inf;
    for(auto now:ch){
      if(now.d==4){
        j=now.x;
      }else{
        if(j!=-inf)chmin(ans,(now.x-j)*10);
      }
    }
  }
  ch.clear();

  if(ans!=inf)print(ans);
  else print("SAFE");
}

Measured memory_bytes: 8660