#include <bits/stdc++.h>

using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'



signed main() {
    fio();
    int n;
    cin >> n;

    using P = pair<int, char>;
    vector<vector<P>> y(212345), x(212345);
    int offset = 200000;
    string dir = "URDL";
    map<char, vector<vector<pii>>> c2ypx;
    map<char, vector<vector<pii>>> c2ymx;
    rep (i, 4) {
        c2ypx[dir[i]] = vector<vector<pii>>(412345);
        c2ymx[dir[i]] = vector<vector<pii>>(412345);
    }

    rep (i, n) {
        int xx, yy;
        char c;
        cin >> xx >> yy >> c;
        if (c == 'U' or c == 'D') {
            x[xx].push_back(P(yy, c));
        }
        else {
            y[yy].push_back(P(xx, c));
        }
        c2ypx[c][xx + yy].push_back(pii(xx, yy));
        c2ymx[c][yy - xx + offset].push_back(pii(xx, yy));
    }

    int ans = inf;
    rep (i, y.size()) {
        sort(all(y[i]));
        int ma = -inf;
        rep (j, y[i].size()) {
            if (y[i][j].second == 'R') chmax(ma, y[i][j].first);
            else {
                if (ma != -inf) {
                    chmin(ans, 5 * (y[i][j].first - ma));
                }
            }
        }
    }

    rep (i, x.size()) {
        sort(all(x[i]));
        int ma = -inf;
        rep (j, x[i].size()) {
            if (x[i][j].second == 'U') chmax(ma, x[i][j].first);
            else {
                if (ma != -inf) {
                    chmin(ans, 5 * (x[i][j].first - ma));
                }
            }
        }
    }

    rep (i, 412345) {
        vector<pii> r = c2ypx['R'][i];
        vector<pii> u = c2ypx['U'][i];
        sort(all(r));
        sort(all(u));
        if (r.size() == 0 or u.size() == 0) continue;
        int ui = 0;
        rep (i, r.size()) {
            int x = r[i].first;
            while (ui < u.size() and u[ui].first < x) ui++;
            if (ui == u.size()) break;
            int nx = u[ui].first;
            chmin(ans, 10 * (nx - x));
        }
    }

    rep (i, 412345) {
        vector<pii> r = c2ypx['D'][i];
        vector<pii> u = c2ypx['L'][i];
        if (r.size() == 0 or u.size() == 0) continue;
        sort(all(r));
        sort(all(u));
        int ui = 0;
        rep (i, r.size()) {
            int x = r[i].first;
            while (ui < u.size() and u[ui].first < x) ui++;
            if (ui == u.size()) break;
            int nx = u[ui].first;
            chmin(ans, 10 * (nx - x));
        }
    }

    rep (i, 412345) {
        vector<pii> l = c2ymx['L'][i];
        vector<pii> u = c2ymx['U'][i];
        if (l.size() == 0 or u.size() == 0) continue;
        sort(all(l));
        sort(all(u));
        int li = 0;
        rep (i, u.size()) {
            int x = u[i].first;
            while (li < l.size() and l[li].first < x) li++;
            if (li == l.size()) break;
            int nx = l[li].first;
            chmin(ans, 10 * (nx - x));
        }
    }

    rep (i, 412345) {
        vector<pii> l = c2ymx['D'][i];
        vector<pii> u = c2ymx['R'][i];
        if (l.size() == 0 or u.size() == 0) continue;
        sort(all(l));
        sort(all(u));
        int li = 0;
        rep (i, u.size()) {
            int x = u[i].first;
            while (li < l.size() and l[li].first < x) li++;
            if (li == l.size()) break;
            int nx = l[li].first;
            chmin(ans, 10 * (nx - x));
        }
    }

    if (ans == inf) {
        cout << "SAFE" << endl;
    }
    else {
        cout << ans << endl;
    }
}

Measured memory_bytes: 108876