#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

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

template <class T1, class T2>
istream& operator >> (istream& in, pair<T1, T2> &p)
{
    in >> p.first >> p.second;
    return in;
}

template <class T>
istream& operator >> (istream& in, vector<T> &v)
{
    for (T &x : v)
        in >> x;
    return in;
}

template <class T>
ostream& operator << (ostream& out, const vector<vector<T>> &v)
{
    for (const vector<T> &x : v)
        out << x << '\n';
    return out;
}

template <class T>
ostream& operator << (ostream& out, const vector<T> &v)
{
    for (const T &x : v)
        out << x << ' ';
    return out;
}

long long gcd (long long a, long long b)
{
    if (b > a)
        swap(a, b);
    return (b ? gcd(b, a % b) : a);
}

using ll   = long long;
using pii  = pair<int, int>;
using pll  = pair<long long, long long>;
using tiii = pair<pair<int, int>, int>;
using vi   = vector<int>;
using vl   = vector<long long>;
using vvi  = vector<vector<int>>;
using vvl  = vector<vector<long long>>;

#define F          first
#define S          second
#define First      first.first
#define Second     first.second
#define Third      second
#define mp         make_pair
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define per(i,b,a) for (int i = (b); i > (a); i--)
#define all(x)     x.begin(), x.end()
#define ret(x)     return cout << x, 0;
#define throwex    throw runtime_error ("Found the error.");

const int h = 1000000007;

signed main()
{
    ios::sync_with_stdio(false);
    #ifdef ONLINE_JUDGE
    cin.tie(nullptr);
    cout.tie(nullptr);
    cerr.setstate(ios::failbit);
    #endif

    int n;
    cin >> n;
    vector<set<pair<ll, char>>> mx(200001), my(200001), vs1(400001), vs2(400001);
    rep(i,0,n)
    {
        int x, y;
        char u;
        cin >> x >> y >> u;
        mx[x].insert({y, u});
        my[y].insert({x, u});
        vs1[x+y].insert({x, u});
        vs2[200000 + x-y].insert({x, u});
    }
    ll ans = LLONG_MAX;
    rep(i,0,200001)
    {
        int f = -1;
        for(auto p : mx[i])
        {
            if(p.S == 'U')
                f = p.F;
            else if(f != -1 and p.S == 'D')
                ans = min(ans, p.F - f);
        }
    }
    rep(i,0,200001)
    {
        int f = -1;
        for(auto p : my[i])
        {
            if(p.S == 'R')
                f = p.F;
            else if(f != -1 and p.S == 'L')
                ans = min(ans, p.F - f);
        }
    }
    rep(i,0,400001)
    {
        int up = -1, right = -1;
        for(auto p : vs2[i])
        {
            if(p.S == 'U')
                up = p.F;
            else if(p.S == 'R')
                right = p.F;
            else if(up != -1 and p.S == 'L')
                ans = min(ans, 2 * (p.F - up));
            else if(right != -1 and p.S == 'D')
                ans = min(ans, 2 * (p.F - right));
        }
    }
    rep(i,0,400001)
    {
        int down = -1, right = -1;
        for(auto p : vs1[i])
        {
            if(p.S == 'D')
                down = p.F;
            else if(p.S == 'R')
                right = p.F;
            else if(down != -1 and p.S == 'L')
                ans = min(ans, 2 * (p.F - down));
            else if(right != -1 and p.S == 'U')
                ans = min(ans, 2 * (p.F - right));
        }
    }
    if(ans == LLONG_MAX)
        cout << "SAFE";
    else
        cout << ans * 5;
}


Measured memory_bytes: 109568