#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T> constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T> bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) { cout << " "; }
  }
  return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) { cout << " "; }
    }
    if (&v != &vv.back()) { cout << "\n"; }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) { cout << (f ? " " : "\n"); }
  print(forward<Tail>(tail)...);
}
#pragma endregion

int n;
vi x, y, u;
ll ans = INF;

void solve(){
  unordered_map<int, vector<int>> mp_up, mp_down, mp;
  dump(x, y, u);
  rep(i, n){
    if(u[i] == 0) mp_down[x[i]+y[i]].emplace_back(x[i]);
    if(u[i] == 2) mp_up[x[i]-y[i]].emplace_back(x[i]);
    if(u[i] == 3) mp[y[i]].emplace_back(x[i]);
  }
  dump(mp_up);
  dump(mp_down);
  dump(mp);
  for(auto&& e: mp_up){ sort(ALL(e.second)); }
  for(auto&& e: mp_down){ sort(ALL(e.second)); }
  for(auto&& e: mp){ sort(ALL(e.second)); }
  rep(i, n)if(u[i] == 1){
    auto it = lower_bound(ALL(mp_down[x[i]+y[i]]), x[i]);
    if(mp_down.count(x[i]+y[i])
    && it != mp_down[x[i]+y[i]].end()){
      chmin(ans, (*it - x[i]) * 10);
    }
    it = lower_bound(ALL(mp_up[x[i]-y[i]]), x[i]);
    if(mp_up.count(x[i]-y[i])
    && it != mp_up[x[i]-y[i]].end()){
      chmin(ans, (*it - x[i]) * 10);
    }
    it = lower_bound(ALL(mp[y[i]]), x[i]);
    if(mp.count(y[i])
    && it != mp[y[i]].end()){
      chmin(ans, (*it - x[i]) * 5);
    }
  }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  cin >> n;
  x.resize(n);
  y.resize(n);
  u.resize(n);
  rep(i, n){
    char c;
    cin >> x[i] >> y[i] >> c;
    switch(c){
      case 'U': u[i] = 0; break;
      case 'R': u[i] = 1; break;
      case 'D': u[i] = 2; break;
      case 'L': u[i] = 3; break;
    }
  }
  rep(i, 4){
    solve();
    rep(j, n){
      swap(x[j], y[j]);
      y[j] = -y[j];
      u[j] = (u[j]+1)%4;
    }
  }
  print(ans == INF ? "SAFE" : to_string(ans));
}


Measured memory_bytes: 39284