#line 1 "main.cpp"

/**
 * @title Template
 */

#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <map>

#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"

template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) { 
    lhs = rhs; 
    return true; 
  }
  return false;
}

/**
 * @title Chmin/Chmax
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"

class range {
public:
  class iterator {
  private:
    int64_t M_position;

  public:
    constexpr iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { ++M_position; }
    constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };

  class reverse_iterator {
  private:
    int64_t M_position;
  
  public:
    constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
    constexpr void operator ++ () noexcept { --M_position; }
    constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
    constexpr int64_t operator * () const noexcept { return M_position; }

  };
  
private:
  const iterator M_first, M_last;

public:
  constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
  constexpr iterator begin() const noexcept { return M_first; }
  constexpr iterator end() const noexcept { return M_last; }
  constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } 
  constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } 

};

/**
 * @title Range
 */
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"

template <class T>
class rev_impl {
public:
  using iterator = typename std::decay<T>::type::reverse_iterator;

private:
  const iterator M_begin;
  const iterator M_end;

public:
  constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
  constexpr iterator begin() const noexcept { return M_begin; }
  constexpr iterator end() const noexcept { return M_end; }

};

template <class T>
constexpr decltype(auto) rev(T &&cont) {
  return rev_impl<T>(std::forward<T>(cont));
}

/**
 * @title Reverser
 */
#line 17 "main.cpp"

using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;

constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;

// (0, 1) crashes but (1, 0) doesn't
i32 solve(std::vector<std::pair<i32, bool>> vec) {
  std::sort(vec.begin(), vec.end());
  i32 res = inf32;
  i32 last = -1;
  for (auto i: range(0, vec.size())) {
    if (vec[i].second) {
      if (last != -1) {
        chmin(res, vec[i].first - vec[last].first);
      }
    }
    else {
      last = i;
    }
  }
  return res;
}

int main() {
  i32 N;
  std::cin >> N;
  std::vector<i32> X(N), Y(N);
  std::vector<char> D(N);
  for (auto i: range(0, N)) {
    std::cin >> X[i] >> Y[i] >> D[i];
  }
  i32 ans = inf32;
  {
    std::map<i32, std::vector<std::pair<i32, bool>>> map;
    for (auto i: range(0, N)) {
      if (D[i] == 'L') {
        map[Y[i]].emplace_back(X[i], 1);
      }
      if (D[i] == 'R') {
        map[Y[i]].emplace_back(X[i], 0);
      }
    }
    for (const auto &[ignore, vec]: map) {
      i32 tmp = solve(vec);
      if (tmp != inf32) {
        chmin(ans, tmp * 5);
      }
    }
  }
  {
    std::map<i32, std::vector<std::pair<i32, bool>>> map;
    for (auto i: range(0, N)) {
      if (D[i] == 'U') {
        map[X[i]].emplace_back(Y[i], 0);
      }
      if (D[i] == 'D') {
        map[X[i]].emplace_back(Y[i], 1);
      }
    }
    for (const auto &[ignore, vec]: map) {
      i32 tmp = solve(vec);
      if (tmp != inf32) {
        chmin(ans, tmp * 5);
      }
    }
  }
  {
    std::map<i32, std::vector<std::pair<i32, bool>>> map;
    for (auto i: range(0, N)) {
      if (D[i] == 'L') {
        map[X[i] - Y[i]].emplace_back(X[i], 1);
      }
      if (D[i] == 'U') {
        map[X[i] - Y[i]].emplace_back(X[i], 0);
      }
    }
    for (const auto &[ignore, vec]: map) {
      i32 tmp = solve(vec);
      if (tmp != inf32) {
        chmin(ans, tmp * 10);
      }
    }
  }
  {
    std::map<i32, std::vector<std::pair<i32, bool>>> map;
    for (auto i: range(0, N)) {
      if (D[i] == 'D') {
        map[X[i] - Y[i]].emplace_back(X[i], 1);
      }
      if (D[i] == 'R') {
        map[X[i] - Y[i]].emplace_back(X[i], 0);
      }
    }
    for (const auto &[ignore, vec]: map) {
      i32 tmp = solve(vec);
      if (tmp != inf32) {
        chmin(ans, tmp * 10);
      }
    }
  }
  {
    std::map<i32, std::vector<std::pair<i32, bool>>> map;
    for (auto i: range(0, N)) {
      if (D[i] == 'L') {
        map[X[i] + Y[i]].emplace_back(X[i], 1);
      }
      if (D[i] == 'D') {
        map[X[i] + Y[i]].emplace_back(X[i], 0);
      }
    }
    for (const auto &[ignore, vec]: map) {
      i32 tmp = solve(vec);
      if (tmp != inf32) {
        chmin(ans, tmp * 10);
      }
    }
  }
  {
    std::map<i32, std::vector<std::pair<i32, bool>>> map;
    for (auto i: range(0, N)) {
      if (D[i] == 'U') {
        map[X[i] + Y[i]].emplace_back(X[i], 1);
      }
      if (D[i] == 'R') {
        map[X[i] + Y[i]].emplace_back(X[i], 0);
      }
    }
    for (const auto &[ignore, vec]: map) {
      i32 tmp = solve(vec);
      if (tmp != inf32) {
        chmin(ans, tmp * 10);
      }
    }
  }
  if (ans == inf32) {
    std::cout << "SAFE\n";
  }
  else {
    std::cout << ans << '\n';
  }
  return 0;
}


Measured memory_bytes: 26588