#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \
  do {                                                                         \
    sort(ALL((vec)));                                                          \
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

ll N, X[1LL << 18], Y[1LL << 18];
char D[1LL << 18];

void Rotate() {
  REP(i, N) {
    ll cx = Y[i];
    ll cy = 200000 - X[i];
    char cz;
    if (D[i] == 'U')
      cz = 'R';
    if (D[i] == 'R')
      cz = 'D';
    if (D[i] == 'D')
      cz = 'L';
    if (D[i] == 'L')
      cz = 'U';
    X[i] = cx;
    Y[i] = cy;
    D[i] = cz;
  }
}

vector<pair<ll, char>> V1[1LL << 19];
vector<pair<ll, char>> V2[1LL << 19];

ll solve_1() {
  ll ans = llINF / 10;
  REP(i, 500001) V1[i].clear();
  REP(i, N) {
    if (!(D[i] == 'R' || D[i] == 'U'))
      continue;
    V1[X[i] + Y[i]].push_back({X[i], D[i]});
  }
  REP(i, 500001) {
    sort(ALL(V1[i]));
    if (V1[i].size() <= 1)
      continue;
    REP(j, (V1[i].size() - 1LL)) {
      if (!(V1[i][j].second == 'R' && V1[i][j + 1].second == 'U'))
        continue;
      ans = min(ans, V1[i][j + 1].first - V1[i][j].first);
    }
  }
  return ans * 10;
}

ll solve_2() {
  ll ans = llINF / 10;
  REP(i, 500001) V2[i].clear();
  REP(i, N) {
    if (!(D[i] == 'L' || D[i] == 'R'))
      continue;
    V2[Y[i]].push_back({X[i], D[i]});
  }
  REP(i, 500001) {
    sort(ALL(V2[i]));
    if (V2[i].size() <= 1)
      continue;
    REP(j, (V2[i].size() - 1LL)) {
      if (!(V2[i][j].second == 'R' && V2[i][j + 1].second == 'L'))
        continue;
      ans = min(ans, V2[i][j + 1].first - V2[i][j].first);
    }
  }
  // cout << llINF / 10 << ans << endl;
  return ans * 5;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> N;
  REP(i, N) cin >> X[i] >> Y[i] >> D[i];
  ll ans = llINF / 10;
  REP(i, 4) {
    ans = min(solve_1(), ans);
    ans = min(solve_2(), ans);
    Rotate();
  }
  if (ans == llINF / 10)
    cout << "SAFE" << endl;
  else
    cout << ans << endl;

  return 0;
}


Measured memory_bytes: 47996