#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int sgn(int x) { return (x > 0) - (x < 0); }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;

    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

int N;
int WIDTH = 220000;
int f(vint X, vint Y, vector<char> U) {
    int ret = INT_MAX;
    {
        vector<vector<pair<int, char>>> h(WIDTH, vector<pair<int, char>>());
        rep(i, N) { h[Y[i]].push_back({X[i], U[i]}); }
        rep(i, WIDTH) {
            sort(all(h[i]));
            int cur = INT_MIN;
            rep(j, h[i].size()) {
                if (h[i][j].second == 'R') { cur = h[i][j].first; }
                if (h[i][j].second == 'L') { chmin(ret, h[i][j].first - cur); }
            }
        }
    }
    {
        vector<vector<pair<int, char>>> h(WIDTH * 2, vector<pair<int, char>>());
        rep(i, N) { h[X[i] + Y[i]].push_back({X[i], U[i]}); }
        rep(i, WIDTH * 2) {
            sort(all(h[i]));
            int cur = INT_MIN;
            rep(j, h[i].size()) {
                if (h[i][j].second == 'R') { cur = h[i][j].first; }
                if (h[i][j].second == 'U') { chmin(ret, (h[i][j].first - cur) * 2); }
            }
        }
    }
    return ret;
}
signed main() {
    cin >> N;
    vint X(N), Y(N);
    vector<char> U(N);
    rep(i, N) { cin >> X[i] >> Y[i] >> U[i]; }
    int ans = INT_MAX;
    rep(i, 4) {
        rep(j, N) {
            swap(X[j], Y[j]);
            X[j] = WIDTH - 100 - X[j];
            if (U[j] == 'U') { U[j] = 'L'; }
            else if (U[j] == 'D') { U[j] = 'R'; }
            else if (U[j] == 'L') { U[j] = 'D'; }
            else if (U[j] == 'R') { U[j] = 'U'; }
        }
        chmin(ans, f(X, Y, U));
    }
    if (ans == INT_MAX) { cout << "SAFE" << endl; }
    else { cout << ans * 5 << endl; }
}


Measured memory_bytes: 36500