#include<bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

vector<PI> u, d, l, r;
li n;


int main() {
    cin >> n;
    rin{
        li x, y;
        char typ;
        cin >> x >> y >> typ;
        switch (typ) {
        case 'U':
            u.pb({x, y});
            break;
        case 'D':
            d.pb({x, y});
            break;
        case 'L':
            l.pb({x, y});
            break;
        case 'R':
            r.pb({x, y});
            break;
        }
    }
    li res = INF;

    {
        // up-down
        vector<set<li>> dd(200200);
        for (auto p : d) {
            dd[p.F].insert(p.S);
        }
        for (auto p : u) {
            auto it = dd[p.F].lower_bound(p.S);
            if (it != dd[p.F].end()) {
                res = min(res, *it - p.S);
            }
        }
    }
    {
        // left-right
        vector<set<li>> ll(200200);
        for (auto p : l) {
            ll[p.S].insert(p.F);
        }
        for (auto p : r) {
            auto it = ll[p.S].lower_bound(p.F);
            if (it != ll[p.S].end()) {
                res = min(res, *it - p.F);
            }
        }
    }
    {
        // up-right
        vector<set<li>> ru(400200);
        for (auto p : r) {
            ru[p.F + p.S].insert(p.S);
        }
        for (auto p : u) {
            auto it = ru[p.F + p.S].lower_bound(p.S);
            if (it != ru[p.F + p.S].end()) {
                res = min(res, (*it - p.S) * 2);
            }
        }
    }
    {
        // up-left
        vector<set<li>> lu(400200);
        for (auto p : l) {
            lu[p.F - p.S + 200000].insert(p.S);
        }
        for (auto p : u) {
            auto it = lu[p.F - p.S + 200000].lower_bound(p.S);
            if (it != lu[p.F - p.S + 200000].end()) {
                res = min(res, (*it - p.S) * 2);
            }
        }
    }
    {
        // down-right
        vector<set<li>> rd(400200);
        for (auto p : r) {
            rd[p.F - p.S + 200000].insert(-p.S);
        }
        for (auto p : d) {
            auto it = rd[p.F - p.S + 200000].lower_bound(-p.S);
            if (it != rd[p.F - p.S + 200000].end()) {
                res = min(res, (*it + p.S) * 2);
            }
        }
    }
    {
        // down-left
        vector<set<li>> ld(400200);
        for (auto p : l) {
            ld[p.F + p.S].insert(-p.S);
        }
        for (auto p : d) {
            auto it = ld[p.F + p.S].lower_bound(-p.S);
            if (it != ld[p.F + p.S].end()) {
                res = min(res, (*it + p.S) * 2);
            }
        }
    }


    cout << (res == INF ? "SAFE" : to_string(res * 5)) << endl;
    return 0;
}

Measured memory_bytes: 40220