#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
    T x;         \
    cin >> x;
#define AIN(T, a, n) \
    vector<T> a(n);  \
    FOR(i, a)        \
    cin >> i;
#define A2IN(T1, a, T2, b, n) \
    vector<T1> a(n);          \
    vector<T2> b(n);          \
    REP(i, n)                 \
    cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
    SORT(a);     \
    reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a)          \
    cout << #a << " = {"; \
    JOUT(ALL(a), ", ", cout) << "}" << endl;

template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
    if (s != e)
    {
        os << *s;
        ++s;
    }
    while (s != e)
    {
        os << sep << *s;
        ++s;
    }
    return os;
}

ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
    if (cond)
    {
        os << yes << endl;
    }
    else
    {
        os << no << endl;
    }
    return os;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    os << '[';
    JOUT(ALL(v), ", ", os) << ']';
    return os;
}

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template

int main()
{
    IN(ll, N);
    vi X(N), Y(N);
    vector<char> u(N);
    REP(i, N)
    {
        cin >> X[i] >> Y[i] >> u[i];
    }
    ll W = *max_element(ALL(X)) + 1;
    ll H = *max_element(ALL(Y)) + 1;
    ll ans = INF;
    // 反対向きの処理
    {
        vvi L(H), R(H), U(W), D(W);
        REP(i, N)
        {
            if (u[i] == 'L')
            {
                L[Y[i]].push_back(X[i]);
            }
            if (u[i] == 'R')
            {
                R[Y[i]].push_back(X[i]);
            }
            if (u[i] == 'U')
            {
                U[X[i]].push_back(Y[i]);
            }
            if (u[i] == 'D')
            {
                D[X[i]].push_back(Y[i]);
            }
        }

        REP(i, H)
        {
            SORT(L[i]);
            SORT(R[i]);
        }
        REP(i, H)
        {
            ll k = 0;
            FOR(x, R[i])
            {
                while (k < L[i].size() and x > L[i][k])
                {
                    ++k;
                }
                if (k < L[i].size())
                {
                    CH(min, ans, 5 * (L[i][k] - x));
                }
            }
        }

        REP(i, W)
        {
            SORT(U[i]);
            SORT(D[i]);
        }
        REP(i, W)
        {
            ll k = 0;
            FOR(x, U[i])
            {
                while (k < D[i].size() and x > D[i][k])
                {
                    ++k;
                }
                if (k < D[i].size())
                {
                    CH(min, ans, 5 * (D[i][k] - x));
                }
            }
        }
    }

    // 交わるやつの処理
    vii L, R, U, D;
    REP(i, N)
    {
        if (u[i] == 'L')
        {
            L.push_back({X[i], Y[i]});
        }
        if (u[i] == 'R')
        {
            R.push_back({X[i], Y[i]});
        }
        if (u[i] == 'U')
        {
            U.push_back({X[i], Y[i]});
        }
        if (u[i] == 'D')
        {
            D.push_back({X[i], Y[i]});
        }
    }
    // 右vs下
    {
        RSORT(R);
        RSORT(D);
        ll k = 0;
        map<ll, ll> z;
        for (auto [x, y] : R)
        {
            while (k < D.size() and x < D[k].first)
            {
                z[D[k].second - D[k].first] = D[k].first;
                ++k;
            }
            if (z.find(y - x) != z.end())
            {
                CH(min, ans, 10 * (z[y - x] - x));
            }
        }
    }
    // 右vs上
    {
        RSORT(R);
        RSORT(U);
        ll k = 0;
        map<ll, ll> z;
        for (auto [x, y] : R)
        {
            while (k < U.size() and x < U[k].first)
            {
                z[U[k].second + U[k].first] = U[k].first;
                ++k;
            }
            if (z.find(y + x) != z.end())
            {
                CH(min, ans, 10 * (z[y + x] - x));
            }
        }
    }
    // 左vs下
    {
        SORT(L);
        SORT(D);
        ll k = 0;
        map<ll, ll> z;
        for (auto [x, y] : L)
        {
            while (k < D.size() and x > D[k].first)
            {
                z[D[k].second + D[k].first] = D[k].first;
                ++k;
            }
            if (z.find(y + x) != z.end())
            {
                CH(min, ans, 10 * (x - z[y + x]));
            }
        }
    }
    // 右vs上
    {
        SORT(L);
        SORT(U);
        ll k = 0;
        map<ll, ll> z;
        for (auto [x, y] : L)
        {
            while (k < U.size() and x > U[k].first)
            {
                z[U[k].second - U[k].first] = U[k].first;
                ++k;
            }
            if (z.find(y - x) != z.end())
            {
                CH(min, ans, 10 * (x - z[y - x]));
            }
        }
    }

    if (ans == INF)
    {
        OUT("SAFE");
    }
    else
    {
        OUT(ans);
    }
}

Measured memory_bytes: 31296