#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } 
} init_io; 
}
#define CPP17


int main() {
    using plane = std::tuple<ll, ll, char>;
    const ll inf = 5e15;
    ll n;
    std::cin >> n;
    vec<plane> pv(n);
    for (auto &[ x, y, c ] : pv) {
        std::cin >> x >> y >> c;
        x *= 10;
        y *= 10;
    }

    ll ans = inf;

    {
        std::map<ll, std::set<ll>> umap, dmap, lmap, rmap;
        for (auto [ x, y, c ] : pv) {
            if (c == 'U') umap[x].insert(y);
            if (c == 'D') dmap[x].insert(y);
            if (c == 'L') lmap[y].insert(x);
            if (c == 'R') rmap[y].insert(x);
        }

        for (auto &[ x, uset ] : umap) {
            auto &dset = dmap[x];
            for (ll y : uset) {
                auto ite = dset.lower_bound(y);
                if (ite == dset.end()) continue;
                chmin(ans, (*ite - y) / 2);
            }
        }
        for (auto &[ y, rset ] : rmap) {
            auto &lset = lmap[y];
            for (ll x : rset) {
                auto ite = lset.lower_bound(x);
                if (ite == lset.end()) continue;
                chmin(ans, (*ite - x) / 2);
            }
        }
    }

    {
        std::map<ll, std::set<ll>> umap, dmap, lmap, rmap;
        for (auto [ x, y, c ] : pv) {
            ll key = y - x;
            if (c == 'U') umap[key].insert(x);
            if (c == 'D') dmap[key].insert(x);
            if (c == 'L') lmap[key].insert(x);
            if (c == 'R') rmap[key].insert(x);
        }

        for (auto &[ key, uset ] : umap) {
            auto &lset = lmap[key];
            for (ll x : uset) {
                auto ite = lset.lower_bound(x);
                if (ite == lset.end()) continue;
                chmin(ans, *ite - x);
            }
        }
        for (auto &[ key, rset ] : rmap) {
            auto &dset = dmap[key];
            for (ll x : rset) {
                auto ite = dset.lower_bound(x);
                if (ite == dset.end()) continue;
                chmin(ans, *ite - x);
            }
        }
    }
    
    {
        std::map<ll, std::set<ll>> umap, dmap, lmap, rmap;
        for (auto [ x, y, c ] : pv) {
            ll key = y + x;
            if (c == 'U') umap[key].insert(x);
            if (c == 'D') dmap[key].insert(x);
            if (c == 'L') lmap[key].insert(x);
            if (c == 'R') rmap[key].insert(x);
        }

        for (auto &[ key, rset ] : rmap) {
            auto &uset = umap[key];
            for (ll x : rset) {
                auto ite = uset.lower_bound(x);
                if (ite == uset.end()) continue;
                chmin(ans, *ite - x);
            }
        }
        for (auto &[ key, dset ] : dmap) {
            auto &lset = lmap[key];
            for (ll x : dset) {
                auto ite = lset.lower_bound(x);
                if (ite == lset.end()) continue;
                chmin(ans, *ite - x);
            }
        }
    }

    if (ans == inf) std::cout << "SAFE";
    else std::cout << ans;
    std::cout << "\n";
    return 0;
}


Measured memory_bytes: 54108