#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

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

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

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

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); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N;
  cin >> N;
  vector< int > X(N), Y(N);
  vector< int > V[4];
  const string S = "URDL";
  for(int i = 0; i < N; i++) {
    char C;
    cin >> X[i] >> Y[i] >> C;
    V[S.find(C)].emplace_back(i);
  }
  int64 ret = infll;

  auto check1 = [](vector< int > X, vector< int > Y, vector< int > plus, vector< int > neg) {
    map< int, set< int > > mp;
    for(auto &p : plus) mp[Y[p]].emplace(X[p]);
    int64 ret = infll;
    for(auto &p : neg) {
      if(!mp.count(Y[p])) continue;
      auto &vs = mp[Y[p]];
      auto low = vs.upper_bound(X[p]);
      if(begin(vs) != low) {
        --low;
        chmin(ret, X[p] - *low);
      }
    }
    return ret;
  };

  auto check2 = [&](vector< int > up, vector< int > hidari) {
    map< int, set< int > > mp;
    for(auto &p : up) {
      mp[X[p] + Y[p]].emplace(X[p] - Y[p]);
    }
    int64 ret = infll;
    for(auto &p : hidari) {
      if(!mp.count(X[p] + Y[p])) continue;
      auto &vs = mp[X[p] + Y[p]];
      auto low = vs.upper_bound(X[p] - Y[p]);
      if(end(vs) != low) {
        chmin(ret, Y[p] - X[p] + *low);
      }
    }
    return ret;
  };


  // 対向の判定
  chmin(ret, check1(Y, X, V[0], V[2]));
  chmin(ret, check1(X, Y, V[1], V[3]));
  // 十字形の判定
  chmin(ret, check2(V[0], V[1]));
  for(auto &p : Y) p *= -1;
  chmin(ret, check2(V[2], V[1]));

  for(auto &p : Y) p *= -1;
  for(auto &p : X) p *= -1;
  chmin(ret, check2(V[0], V[3]));
  for(auto &p : Y) p *= -1;
  chmin(ret, check2(V[2], V[3]));

  if(ret >= inf) cout << "SAFE\n";
  else cout << ret * 5 << "\n";
}



Measured memory_bytes: 33992