#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, y, u;
  int add, dec;

  plane(int x, int y, int u) : x(x), y(y), u(u), add(x+y), dec(x-y) {}

  bool operator<(plane a) {
    return x != a.x ? x < a.x : y < a.y;
  }
};

const int INFTY = 1<<30;

void solve() {
  int n; cin >> n;
  vi d(128);
  d['U'] = 0, d['R'] = 1, d['D'] = 2, d['L'] = 3;
  vector<plane> planes, xs, ys;
  rep(_,n) {
    int x, y; char c; cin >> x >> y >> c;
    planes.emplace_back(x, y, d[c]);
    if (d[c] & 1) xs.emplace_back(y, x, d[c]);
    else ys.emplace_back(x, y, d[c]);
  }

  int dist = INFTY;
  vi prev(2, -INFTY);

  sort(ALL(planes), [](plane a, plane b) {
    return a.add != b.add ? a.add < b.add : a.dec < b.dec;
  });

  if (__builtin_parity(planes[0].u)) prev[planes[0].u - 1] = planes[0].dec;
  rep1(i,n) {
    if (planes[i-1].add != planes[i].add) prev[0] = prev[1] = -INFTY;
    if (__builtin_parity(planes[i].u)) prev[planes[i].u - 1] = planes[i].dec;
    else chmin(dist, planes[i].dec - prev[planes[i].u & 1]);
  }

  prev[0] = prev[1] = -INFTY;

  sort(ALL(planes), [](plane a, plane b) {
    return a.dec != b.dec ? a.dec < b.dec : a.add < b.add;
  });

  if (planes[0].u < 2) prev[planes[0].u] = planes[0].add;
  rep1(i,n) {
    if (planes[i-1].dec != planes[i].dec) prev[0] = prev[1] = -INFTY;
    if (planes[i].u < 2) prev[planes[i].u] = planes[i].add;
    else chmin(dist, planes[i].add - prev[3 - planes[i].u]);
  }

  auto f = [&](vector<plane> &g) {
    if (g.empty()) return;
    sort(ALL(g));
    int pre = -INFTY;
    if (g[0].u < 2) pre = g[0].y;
    rep1(i,g.size()) {
      if (g[i-1].x != g[i].x) pre = -INFTY;
      if (g[i].u < 2) pre = g[i].y;
      else chmin(dist, g[i].y - pre);
    }
  };

  f(xs);
  f(ys);

  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: 15996