#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i,n) for (int i=0; i<(int)(n); ++i)
#define rep1(i,n) for (int i=1; i<(int)(n); ++i)
#define repeq(i,n) for (int i=0; i<=(int)(n); ++i)
#define rep1eq(i,n) for (int i=1; i<=(int)(n); ++i)
#define rrep(i,n) for (int i=(int)(n)-1; i>=0; --i)
#define rrep1(i,n) for (int i=(int)(n)-1; i>0; --i)
#define rrepeq(i,n) for (int i=(int)(n); i>=0; --i)
#define rrep1eq(i,n) for (int i=(int)(n); i>0; --i)
#define REP(i,a,b) for (int i=(int)(a); i<=(int)(b); ++i)
#define RREP(i,a,b) for (int i=(int)(a); i>=(int)(b); --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const int MOD = 1e9+7;
const int MOD2 = 998244353;
// const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
string interval[2] = {" ", "\n"}; // {" ", "\n"}

template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
 
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << " " << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if (vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
 
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << "\n"; return a; }

template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

long long modpow(int a, long long n, int mod = MOD) { long long ret = 1; do { if (n & 1) ret = ret * a % mod; a = 1LL * a * a % mod; } while (n >>= 1); return ret; }

template<typename T> T GCD(T a, T b) { return b ? GCD(b, a%b) : a; }
template<typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }

template<typename T1, typename T2> bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) { return a.second != b.second ? a.second < b.second : a.first < b.first; }
template<typename T1, typename T2> bool CompareByInverse(pair<T1, T2> a, pair<T1, T2> b) { return a.first != b.first ? a.first < b.first : a.second > b.second; }


/* -------- <templates end> -------- */


struct plane {
  int x, u;

  plane(int x, int u) : x(x), u(u) {}

  bool operator<(plane a) {
    return x < a.x;
  }
};

const int INFTY = 1<<30;
const int sz = 2e5;

void solve() {
  int n; cin >> n;
  Graph<plane> xs(sz+1), ys(sz+1), add(sz*2+1), dec(sz*2+1);
  vi det(200, 0);
  det['U'] = 0, det['R'] = 1, det['D'] = 2, det['L'] = 3;
  rep(_,n) {
    int x, y; char u; cin >> x >> y >> u;
    if (det[u] & 1) xs[y].emplace_back(x, det[u]);
    else ys[x].emplace_back(y, det[u]);
    add[x+y].emplace_back(x-y, det[u]);
    dec[x-y+sz].emplace_back(x+y, det[u]);
  }

  int dist = INFTY;

  auto straight = [&](Graph<plane> &g) -> void {
    for (auto &vec : g) {
      if (vec.empty()) continue;
      sort(ALL(vec));
      int prev = -INFTY;
      for (auto &v : vec) {
        if (v.u < 2) prev = v.x;
        else chmin(dist, v.x - prev);
      }
    }
  };

  straight(xs);
  straight(ys);

  for (auto &vec : add) {
    if (vec.empty()) continue;
    sort(ALL(vec));
    vi prev(2, -INFTY);
    for (auto &v : vec) {
      if (__builtin_parity(v.u)) prev[v.u - 1] = v.x;
      else chmin(dist, v.x - prev[v.u & 1]);
    }
  }

  for (auto &vec : dec) {
    if (vec.empty()) continue;
    sort(ALL(vec));
    vi prev(2, -INFTY);
    for (auto &v : vec) {
      if (v.u < 2) prev[v.u] = v.x;
      else chmin(dist, v.x - prev[3 - v.u]);
    }
  }

  if (dist > INFTY / 2) cout << "SAFE\n";
  else cout << dist * 5 << endl;
}


/* -------- <programs end> -------- */


signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  solve();
  return 0;
}


Measured memory_bytes: 49904