#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;

typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;

#define pb push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()

#define for1(i0, l0, r0) for (int i0 = l0; i0 < r0; ++i0)
#define for2(i0, l0, r0) for (int i0 = l0; i0 <= r0; ++i0)
#define forn(i0, n0) for (int i0 = 0; i0 < n0; ++i0)
#define forn1(i0, n0) for (int i0 = 1; i0 < n0; ++i0)
#define forr(i0, n0) for (int i0 = n0; i0 >= 0; --i0)
#define forr1(i0, r0, l0) for (int i0 = r0; i0 > l0; --i0)
#define forr2(i0, r0, l0) for (int i0 = r0; i0 >= l0; --i0)

#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define relaxMax(a, b) a = max(a, b)
#define relaxMin(a, b) a = min(a, b)

typedef long double ld;
#define ui unsigned int
#define ull unsigned long long

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;

typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;

typedef vector<vi> vvi;
typedef vector<vd> vvd;
typedef vector<vll> vvll;
typedef vector<vb> vvb;

#define vpss vector<pss>
#define vvs vector<vs>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vpt vector<pt>
#define vvvi vector<vvi>
#define vsi vector<set<int>>
#define ss second
#define ff first

#define printvi(arr) for (int x0 : arr) cout << x0 << ' '; cout << '\n';
#define printvll(arr) for (ll x0 : arr) cout << x0 << ' '; cout << '\n';
#define printpair(pair0) cout << pair0.F << ' ' << pair0.S << '\n';
#define printvp(arr) for (auto pair0 : arr) printpair(pair0);
#define initArray(arr, N0, X0) memset(arr, X0, N0 * sizeof(int))
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void init() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    //cout.precision(16);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
}

void solve() {
    int n;
    cin >> n;
    int t = 1e9;
    vvi a(n, vi(3));
    map<char, int> U;
    U['U'] = 0;
    U['R'] = 1;
    U['D'] = 2;
    U['L'] = 3;
    map<int, vi> d1, d2, h, v;
    forn(i, n) {
        string s;
        forn(j, 2) cin >> a[i][j];
        cin >> s;
        a[i][2] = U[s[0]];
        int x = a[i][0], y = a[i][1];
        d1[x + y].pb(i);
        d2[x - y].pb(i);
        h[y].pb(i);
        v[x].pb(i);
    }
    for (auto p : h) {
        set<int> l, r;
        for (int i : p.S) {
            if (a[i][2] == 3) l.insert(a[i][0]);
            if (a[i][2] == 1) r.insert(a[i][0]);
        }
        l.insert(1e6);
        for (int x : r) {
            int x1 = *l.upper_bound(x);
            if (x1 < 1e6) t = min(t, x1 - x);
        }
    }
    for (auto p : v) {
        set<int> u, d;
        for (int i : p.S) {
            if (a[i][2] == 0) u.insert(a[i][1]);
            if (a[i][2] == 2) d.insert(a[i][1]);
        }
        d.insert(1e6);
        for (int y : u) {
            int y1 = *d.upper_bound(y);
            if (y1 < 1e6) t = min(t, y1 - y);
        }
    }
    for (auto p : d1) {
        set<int> l, r, u, d;
        for (int i : p.S) {
            if (a[i][2] == 0) u.insert(a[i][0]);
            if (a[i][2] == 1) r.insert(a[i][0]);
            if (a[i][2] == 2) d.insert(a[i][0]);
            if (a[i][2] == 3) l.insert(a[i][0]);
        }
        u.insert(1e6);
        for (int x : r) {
            int x1 = *u.upper_bound(x);
            if (x1 < 1e6) t = min(t, 2 * (x1 - x));
        }
        l.insert(1e6);
        for (int x : d) {
            int x1 = *l.upper_bound(x);
            if (x1 < 1e6) t = min(t, 2 * (x1 - x));
        }
    }
    for (auto p : d2) {
        set<int> l, r, u, d;
        for (int i : p.S) {
            if (a[i][2] == 0) u.insert(a[i][0]);
            if (a[i][2] == 1) r.insert(a[i][0]);
            if (a[i][2] == 2) d.insert(a[i][0]);
            if (a[i][2] == 3) l.insert(a[i][0]);
        }
        l.insert(1e6);
        for (int x : u) {
            int x1 = *l.upper_bound(x);
            if (x1 < 1e6) t = min(t, 2 * (x1 - x));
        }
        d.insert(1e6);
        for (int x : r) {
            int x1 = *d.upper_bound(x);
            if (x1 < 1e6) t = min(t, 2 * (x1 - x));
        }
    }
    if (t == 1e9)
        cout << "SAFE\n";
    else
        cout << t * 5 << '\n';
}

bool multitest = false;

int main() {
    init();
    int t = 1;
    if (multitest) cin >> t;
    forn(i, t) solve();
}

Measured memory_bytes: 89852