#line 1 "/workspaces/compro/lib/template.hpp"


#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

template <class T> void say(bool val, T yes, T no) { cout << (val ? yes : no) << "\n"; }

void say(bool val, string yes = "Yes", string no = "No") { say<string>(val, yes, no); }

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// C++ 17に完全移行したら消す
// 最大公約数を求める
template <class T> T gcd(T n, T m) { return n ? gcd(m % n, n) : m; }

// 最小公倍数を求める
template <class T> T lcm(T n, T m) {
  int g = gcd(n, m);
  return n * m / g;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}


#line 2 "m_solutions2020_f.cpp"

using Data = pair<char, pair<int, int>>;

char dir[4] = {'L', 'D', 'R', 'U'};

void rotate(vector<Data> &data) {

  map<char, int> mp;
  mp['L'] = 0;
  mp['D'] = 1;
  mp['R'] = 2;
  mp['U'] = 3;

  for (auto &el : data) {
    auto tmp = el;
    el.first = dir[(mp[tmp.first] + 1) % 4];
    el.second.first = -tmp.second.second;
    el.second.second = tmp.second.first;
  }
}

int collFrot(vector<Data> &data) {
  map<int, vector<int>> mp;
  for (auto &el : data) {
    if (el.first == 'D') {
      mp[el.second.first].push_back(el.second.second);
    }
  }

  for (auto &v : mp) {
    sort(ALL(v.second));
  }

  int ans = numeric_limits<int>::max();

  for (auto &el : data) {
    if (el.first == 'U') {
      auto itr = lower_bound(ALL(mp[el.second.first]), el.second.second);
      if (itr != mp[el.second.first].end()) {
        auto d = ((*itr) - el.second.second) * 5;
        chmin(ans, d);
      }
    }
  }

  return ans;
}

int collSide(vector<Data> &data) {
  map<int, vector<int>> mp;
  for (auto &el : data) {
    if (el.first == 'L') {
      mp[el.second.second - el.second.first].push_back(el.second.second);
    }
  }

  for (auto &v : mp) {
    sort(ALL(v.second));
  }

  int ans = numeric_limits<int>::max();

  for (auto &el : data) {
    if (el.first == 'U') {
      auto itr = lower_bound(ALL(mp[el.second.second - el.second.first]), el.second.second);
      if (itr != mp[el.second.second - el.second.first].end()) {
        auto d = ((*itr) - el.second.second) * 10;
        chmin(ans, d);
      }
    }
  }
  return ans;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;

  vector<Data> data(n);
  REP(i, n) {
    int x, y;
    char u;
    cin >> x >> y >> u;
    data[i] = {u, {x, y}};
  }

  int ans = numeric_limits<int>::max();

  REP(i, 4) {
    rotate(data);
    chmin(ans, collFrot(data));
    chmin(ans, collSide(data));
  }
  if (ans == numeric_limits<int>::max()) {
    cout << "SAFE" << endl;
  } else {
    cout << ans << endl;
  }
}


Measured memory_bytes: 27216