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

template< typename Monoid >
struct SegmentTree {
  using F = function< Monoid(Monoid, Monoid) >;

  int sz;
  vector< Monoid > seg;

  F f;
  Monoid M1;

  SegmentTree() = default;

  SegmentTree(int n, F f, Monoid M1) : f(f), M1(M1) {
    sz = 1;
    while(sz < n) sz <<= 1;
    seg.assign(2 * sz, M1);
  }

  void set(int k, const Monoid &x) {
    seg[k + sz] = x;
  }

  void build() {
    for(int k = sz - 1; k > 0; k--) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  void update(int k, const Monoid &x) {
    k += sz;
    seg[k] = x;
    while(k >>= 1) {
      seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
    }
  }

  Monoid query(int a, int b) {
    Monoid L = M1, R = M1;
    if(a >= b) return M1;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) L = f(L, seg[a++]);
      if(b & 1) R = f(seg[--b], R);
    }
    return f(L, R);
  }

  Monoid operator[](const int &k) const {
    return seg[k + sz];
  }

  template< typename C >
  int find_subtree(int a, const C &check, Monoid &M, bool type) {
    while(a < sz) {
      Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
      if(check(nxt)) a = 2 * a + type;
      else M = nxt, a = 2 * a + 1 - type;
    }
    return a - sz;
  }


  template< typename C >
  int find_first(int a, const C &check) {
    Monoid L = M1;
    if(a <= 0) {
      if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);
      return -1;
    }
    int b = sz;
    for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
      if(a & 1) {
        Monoid nxt = f(L, seg[a]);
        if(check(nxt)) return find_subtree(a, check, L, false);
        L = nxt;
        ++a;
      }
    }
    return -1;
  }

  template< typename C >
  int find_last(int b, const C &check) {
    Monoid R = M1;
    if(b >= sz) {
      if(check(f(seg[1], R))) return find_subtree(1, check, R, true);
      return -1;
    }
    int a = sz;
    for(b += sz; a < b; a >>= 1, b >>= 1) {
      if(b & 1) {
        Monoid nxt = f(seg[--b], R);
        if(check(nxt)) return find_subtree(b, check, R, true);
        R = nxt;
      }
    }
    return -1;
  }
};

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(p);
    }
    map< int, vector< int > > xs;
    map< int, SegmentTree< int64 > > segs;
    for(auto &_ : mp) {
      auto &vs = _.second;
      vector< int > za;
      for(auto &p : vs) za.emplace_back(X[p]);
      sort(begin(za), end(za));
      za.erase(unique(begin(za), end(za)), end(za));
      xs[_.first] = za;
      auto f = [](int64 a, int64 b) { return min(a, b); };
      SegmentTree< int64 > seg(za.size(), f, infll);
      for(auto &p : vs) {
        int now = lower_bound(begin(za), end(za), X[p]) - begin(za);
        seg.set(now, X[p] - Y[p]);
      }
      seg.build();
      segs.emplace(_.first, seg);
    }
    int64 ret = infll;
    for(auto &p : hidari) {
      if(!mp.count(X[p] + Y[p])) continue;
      auto &vs = xs[X[p] + Y[p]];
      int pos = lower_bound(begin(vs), end(vs), X[p]) - begin(vs);
      auto &seg = segs[X[p] + Y[p]];
      chmin(ret, seg.query(pos, vs.size()) + Y[p] - X[p]);
    }
    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: 86784