//#define NDEBUG

#pragma region cp_template

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

  using i32 = std::int32_t;
  using i64 = std::int64_t;
  using u32 = std::uint32_t;
  using u64 = std::uint64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class F> class rec_lambda {
    F f;

  public:
    rec_lambda(F&& f) : f(std::move(f)) {}
    template <class... Args> auto operator()(Args&&... args) const {
      return f(*this, std::forward<Args>(args)...);
    }
  };
  template <class F> auto make_rec(F&& f) { return rec_lambda<F>(std::move(f)); }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }
  constexpr char eoln = '\n';
  template <class T> T ceildiv(const T& l, const T& r) {
    return l / r + (l % r != 0 ? 1 : 0);
  }

} // namespace n91

#pragma endregion cp_template

#include <map>
#include <numeric>

namespace n91 {

  static constexpr i32 Inf = std::numeric_limits<i32>::max();

  i32 same(std::vector<i32> x, std::vector<i32> y, std::vector<char> u) {
    const usize n = x.size();
    std::map<i32, std::vector<usize>> mp;
    std::vector<usize> idx(n);
    std::iota(idx.begin(), idx.end(), 0);
    std::sort(idx.begin(), idx.end(),
      [&](const usize l, const usize r) { return x[l] < x[r]; });
    for (const usize i : idx) {
      mp[y[i]].push_back(i);
    }
    i32 ret = Inf;
    for (const auto& v : mp) {
      usize prev = n;
      for (const usize i : v.second) {
        if (u[i] == 'R') {
          prev = i;
        }
        if (u[i] == 'L' && prev != n) {
          chmin(ret, x[i] - x[prev]);
        }
      }
    }
    return ret;
  }

  i32 diag(std::vector<i32> x, std::vector<i32> y, std::vector<char> u) {
    const usize n = x.size();
    std::map<i32, std::vector<usize>> mp;
    std::vector<usize> idx(n);
    std::iota(idx.begin(), idx.end(), 0);
    std::sort(idx.begin(), idx.end(),
      [&](const usize l, const usize r) { return x[l] < x[r]; });
    for (const usize i : idx) {
      mp[x[i] + y[i]].push_back(i);
    }
    i32 ret = Inf;
    for (const auto& v : mp) {
      usize prev = n;
      for (const usize i : v.second) {
        if (u[i] == 'R') {
          prev = i;
        }
        if (u[i] == 'U' && prev != n) {
          chmin(ret, (x[i] - x[prev]) * 2);
        }
      }
    }
    return ret;
  }

  void main_() {
    /*
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    //*/
    const usize n = scan<usize>();
    std::vector<i32> x(n), y(n);
    std::vector<char> u(n);
    for (const usize i : rep(0, n)) {
      std::cin >> x[i] >> y[i] >> u[i];
    }

    i32 ans = Inf;
    const auto ssame = [&]() { chmin(ans, same(x, y, u)); };
    const auto sdiag = [&]() { chmin(ans, diag(x, y, u)); };
    ssame();
    {
      std::map<char, char> mp;
      mp['L'] = 'D';
      mp['R'] = 'U';
      mp['U'] = 'R';
      mp['D'] = 'L';
      for (const usize i : rep(0, n)) {
        std::swap(x[i], y[i]);
        u[i] = mp[u[i]];
      }
      ssame();
    }
    for (const usize i : rep(0, 4)) {
      std::map<char, char> mp;
      mp['L'] = 'D';
      mp['R'] = 'U';
      mp['U'] = 'L';
      mp['D'] = 'R';
      for (const usize i : rep(0, n)) {
        auto xx = x[i];
        x[i] = -y[i];
        y[i] = xx;
        u[i] = mp[u[i]];
      }
      sdiag();
    }

    if (ans == Inf) {
      std::cout << "SAFE\n";
    }
    else {
      std::cout << ans * 5 << "\n";
    }
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 30104