/*input 
2
11 1 U
11 47 D
*/ 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ld double
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e16;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
int arr[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    vector<pii> up,down,left,right;
    REP(i,n){
        int x,y;
        char c;
        cin>>x>>y>>c;
        if(c=='U') up.pb({x,y});
        if(c=='D') down.pb({x,y});
        if(c=='L') left.pb({y,x});
        if(c=='R') right.pb({y,x});
    }
    sort(ALL(up)),sort(ALL(down)),sort(ALL(left)),sort(ALL(right));
    int ans=INF;
    for(auto x:up){
        if(lower_bound(ALL(down),x)==down.end()) continue;
        pii z=*lower_bound(ALL(down),x);
        if(z.f==x.f){
            MNTO(ans,5*(z.s-x.s));
        }
    }
    for(auto x:right){
        if(lower_bound(ALL(left),x)==left.end()) continue;
        pii z=*lower_bound(ALL(left),x);
        if(z.f==x.f){
            MNTO(ans,5*(z.s-x.s));
        }
    }
    map<int,set<int>> mp;
    for(auto x:right){
        mp[x.f+x.s].insert(x.f);
    }
    for(auto x:up){
        if(mp[x.f+x.s].lower_bound(x.s)==mp[x.f+x.s].end()) continue;
        int z=*mp[x.f+x.s].lower_bound(x.s);
        MNTO(ans,10*(z-x.s));
    }
    mp.clear();
    for(auto x:left){
        mp[x.f-x.s].insert(x.f);
    }
    for(auto x:up){
        if(mp[x.s-x.f].lower_bound(x.s)==mp[x.s-x.f].end()) continue;
        int z=*mp[x.s-x.f].lower_bound(x.s);
        MNTO(ans,10*(z-x.s));
    }
    mp.clear();
    for(auto x:left){
        mp[x.f+x.s].insert(x.f);
    }
    for(auto x:down){
        if(mp[x.f+x.s].lower_bound(x.s)==mp[x.f+x.s].begin()) continue;
        int z=*prev(mp[x.f+x.s].lower_bound(x.s));
        MNTO(ans,10*(x.s-z));
    }
    mp.clear();
    for(auto x:right){
        mp[x.f-x.s].insert(x.f);
    }
    for(auto x:down){
        if(mp[x.s-x.f].lower_bound(x.s)==mp[x.s-x.f].begin()) continue;
        int z=*prev(mp[x.s-x.f].lower_bound(x.s));
        MNTO(ans,10*(x.s-z));
    }
    if(ans!=INF) cout<<ans;
    else cout<<"SAFE";
}


Measured memory_bytes: 23084