#include <bits/stdc++.h>
#include <chrono> 
 
using namespace std;
using namespace std::chrono; 
 
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); --a)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define pb push_back
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL); cout.tie(NULL);}
#define fix(prec) {cout << setprecision(prec) << fixed;}
#define mp make_pair
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define readgraph(list, edges) for (int i = 0; i < edges; i++) {int a, b; cin >> a >> b; a--; b--; list[a].pb(b); list[b].pb(a);}
#define ai(a, n) for (int ele = 0; ele < n; ele++) cin >> a[ele];
#define ain(a, lb, rb) for (int ele = lb; ele <= rb; ele++) cin >> a[ele];
#define ao(a, n) {for (int ele = 0; ele < (n); ele++) { if (ele) cout << " "; cout << a[ele]; } cout << '\n';}
#define aout(a, lb, rb) {for (int ele = (lb); ele <= (rb); ele++) { if (ele > (lb)) cout << " "; cout << a[ele]; } cout << '\n';}
#define vsz(x) ((long long) x.size())
typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
 
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v);
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
 
mt19937 rng(steady_clock::now().time_since_epoch().count());
// mt19937 rng(61378913);
/* usage - just do rng() */
 
void usaco(string filename) {
  // #pragma message("be careful, freopen may be wrong")
	freopen((filename + ".in").c_str(), "r", stdin);
	freopen((filename + ".out").c_str(), "w", stdout);
}
 
const lld pi = 3.14159265358979323846;
const ll mod = 1000000007;
// const ll mod = 998244353;
// ll mod;
 

 
ll n, m, k, q, l, r, x, y, z;
ll a[1000005];
ll b[1000005];
ll c[1000005];
string s, t;
ll ans = 0;

ll get(char c) {
  if (c == 'U') return 0;
  if (c == 'L') return 1;
  if (c == 'D') return 2;
  return 3;
}
 
void solve(int tc) {
  cin >> n;

  ans = mod * mod;

  pll pts[4][n];
  ll cp[4];
  ms(cp, 0);

  f0r(i, n) {
    pll y; cin >> y;
    char c; cin >> c;
    ll v = get(c);
    pts[v][cp[v]++] = y;
  }

  map<ll, set<ll>> rv;
  f0r(i, cp[2]) rv[pts[2][i].f].insert(pts[2][i].s);
  f0r(i, cp[0]) {
    auto it = rv[pts[0][i].f].lower_bound(pts[0][i].s);
    if (it != rv[pts[0][i].f].end()) {
      ans = min(ans, 5 * (*it - pts[0][i].s));
    }
  }

  rv.clear();

  f0r(i, cp[1]) rv[pts[1][i].s].insert(pts[1][i].f);
  f0r(i, cp[3]) {
    auto it = rv[pts[3][i].s].lower_bound(pts[3][i].f);
    if (it != rv[pts[3][i].s].end()) {
      ans = min(ans, 5 * (*it - pts[3][i].f));
    }
  }

  // right-up
  rv.clear();

  sort(pts[3], pts[3] + cp[3]);
  f0r(i, cp[0]) {
    pll x = pts[0][i];
    rv[x.f + x.s].insert(x.f);
  }
  f0r(i, cp[3]) {
    pll x = pts[3][i];
    while (rv[x.f + x.s].size()) {
      auto it = rv[x.f + x.s].begin();
      if (*it < x.f) {
        rv[x.f + x.s].erase(it);
      } else {
        ans = min(ans, 10 * (*it - x.f));
        break;
      }
    }
  }

  // right-down
  rv.clear();

  f0r(i, cp[2]) {
    pll x = pts[2][i];
    rv[x.f - x.s].insert(x.f);
  }
  f0r(i, cp[3]) {
    pll x = pts[3][i];
    while (rv[x.f - x.s].size()) {
      auto it = rv[x.f - x.s].begin();
      if (*it < x.f) {
        rv[x.f - x.s].erase(it);
      } else {
        ans = min(ans, 10 * (*it - x.f));
        break;
      }
    }
  }

  f0r(i, 4) {
    f0r(j, cp[i]) {
      pts[i][j].f *= -1;
    }
  }

  // left-up
  rv.clear();

  sort(pts[1], pts[1] + cp[1]);
  f0r(i, cp[0]) {
    pll x = pts[0][i];
    rv[x.f + x.s].insert(x.f);
  }
  f0r(i, cp[1]) {
    pll x = pts[1][i];
    while (rv[x.f + x.s].size()) {
      auto it = rv[x.f + x.s].begin();
      if (*it < x.f) {
        rv[x.f + x.s].erase(it);
      } else {
        ans = min(ans, 10 * (*it - x.f));
        break;
      }
    }
  }

  // left-down
  rv.clear();

  f0r(i, cp[2]) {
    pll x = pts[2][i];
    rv[x.f - x.s].insert(x.f);
  }
  f0r(i, cp[1]) {
    pll x = pts[1][i];
    while (rv[x.f - x.s].size()) {
      auto it = rv[x.f - x.s].begin();
      if (*it < x.f) {
        rv[x.f - x.s].erase(it);
      } else {
        ans = min(ans, 10 * (*it - x.f));
        break;
      }
    }
  }

  if (ans == mod * mod) {
    cout << "SAFE\n";
  } else {
    cout << ans << '\n';
  }
}
 
int main() {
  send help
 
  // usaco("cowland");
 
  int tc = 1;
  // cin >> tc;
  for (int t = 0; t < tc; t++) solve(t);
} 

Measured memory_bytes: 43856