#include <vector>
#include <iostream>
#include <cmath>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <fstream>
#include <unistd.h>
#include <string.h>
#include <string>
#include <numeric>
#include <queue>
#include <deque>
#include <sstream>
#include <iomanip>
#include <set>
#include <stack>
#include <cassert>
#include <functional>
#include <random>
using namespace std;
typedef int64_t ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef unordered_map<ll, ll> uii;
typedef unordered_map<ll, ll> uuii;
typedef unordered_map<ll, ll> uuuii;
typedef long double LD;
typedef vector<LD> vld;
typedef vector<pair<LD, LD>> vpld;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
typedef vector<vvpl> vvvpl;
typedef pair<ll, PL> TL;
typedef vector<TL> vtl;
typedef vector<vtl> vvtl;
typedef long double ld;
typedef vector<ld> vld;
const ll LINF = 1e17;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for(ll i = (a); i < b; i++)
#define RFOR(i, a, b) for(ll i = (a); i > b; i--)
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, n) for(ll i = n-1; i > -1; i--)
#define FORMAP(it, m) for(auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(),(X).end()

template <typename T> T gcd(T a, T b) {return (a == 0) ? b : gcd(b%a, a);}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b;}

bool p_comp_fs(const PL p1, const PL p2){ return p1.first < p2.first;};
bool p_comp_fg(const PL p1, const PL p2){ return p1.first > p2.first;};
bool p_comp_ss(const PL p1, const PL p2){ return p1.second < p2.second;};
bool p_comp_sg(const PL p1, const PL p2){ return p1.second > p2.second;};
template <typename T>
vector<T> uniquen(vector<T> vec /* copy */){
    sort(ALL(vec)); vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec;
}

inline ll popcnt(ll x){return __builtin_popcountll((unsigned long long)x);};
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
//friend bool operator<(const tpl& lhs, const tpl& rhs){
//    return std::tie(lhs.l, lhs.r) < std::tie(rhs.l, rhs.r);
//}

bool bit(ll st, ll b){return ((st>>b)&1) == 1;}

void same_horizon(char c1, char c2, unordered_map<ll, unordered_map<char, vl>>& sx, ll& ans){

    FORMAP(it, sx){
        if(it->ss[c1].empty() || it->ss[c2].empty()) continue;

        auto& uv = it->ss[c1];
        auto& dv = it->ss[c2];

        sort(ALL(uv)); sort(ALL(dv));

        for(ll u : uv){
            auto it = upper_bound(ALL(dv), u);
            if(it == dv.end()) continue;
            ll time = (*it - u) * 10 / 2;
            chmin(ans, time);
        }
    }
}




void same_diagonal_sub(unordered_map<ll, unordered_map<char, vpl>>& u, ll& ans){

    FORMAP(it, u){

        auto& vd = it->ss['D'];
        auto& vu = it->ss['U'];
        auto& vl = it->ss['L'];
        auto& vr = it->ss['R'];

        sort(ALL(vd));
        sort(ALL(vr));

        if(!vd.empty() && !vr.empty()){
            for(PL r : vr){
                auto it = upper_bound(ALL(vd), r);
                if(it == vd.end()) continue;
                chmin(ans, abs(it->ff - r.ff) * 10);
            }
        }


        sort(ALL(vu));
        sort(ALL(vl));
        if(!vu.empty() && !vl.empty()){
            for(PL u : vu){
                auto it = upper_bound(ALL(vl), u);
                if(it == vl.end()) continue;
                chmin(ans, abs(it->ff - u.ff) * 10);
            }
        }

    }

}


void same_diagonal_add(unordered_map<ll, unordered_map<char, vpl>>& u, ll& ans){

    FORMAP(it, u){

        auto& vd = it->ss['D'];
        auto& vu = it->ss['U'];
        auto& vl = it->ss['L'];
        auto& vr = it->ss['R'];

        sort(ALL(vr));
        sort(ALL(vu));
        if(!vr.empty() && !vu.empty()){
            for(PL r : vr){
                auto it = upper_bound(ALL(vu), r);
                if(it == vu.end()) continue;
                chmin(ans, abs(r.ff - it->ff) * 10);
            }
        }


        sort(ALL(vd));
        sort(ALL(vl));
        if(!vd.empty() && !vl.empty()){
            for(PL d : vd){
                auto it = upper_bound(ALL(vl), d);
                if(it == vl.end()) continue;
                chmin(ans, abs(d.ff - it->ff) * 10);
            }
        }
    }

}


int main(int argc, const char* argv[]){
    
#if defined(__LOCAL__)
    std::string file_name = argv[1];
    ifstream in_file(file_name.c_str()); cin.rdbuf(in_file.rdbuf());
#else
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
#endif

    ll N; cin >> N;
    vl X(N), Y(N);
    unordered_map<ll, unordered_map<char, vpl>> up, um;
    unordered_map<ll, unordered_map<char, vl>> sx, sy;

    rep(i, N){
        ll x, y; cin >> x >> y; char u; cin >> u;
        sx[x][u].pb(y);
        sy[y][u].pb(x);

        up[x+y][u].pb({x, y});
        um[x-y][u].pb({x, y});
    }

    FORMAP(it, up) FORMAP(vit, it->ss){
        sort(ALL(vit->ss));
    }
    

    ll ans = LINF;
    same_horizon('U', 'D', sx, ans);
    same_horizon('R', 'L', sy, ans);
    
    same_diagonal_sub(um, ans);
    same_diagonal_add(up, ans);
    

    cout << (ans == LINF ? "SAFE" : to_string(ans)) << endstr;

    return 0;
}

Measured memory_bytes: 209032