#include <iostream>
#include <algorithm>
#include <utility>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <string.h>
#include <iomanip>
#include <numeric>
#include <cstdlib>
#include <cstdint>
#include <cmath>
#include <functional>
#include <limits>
#include <cassert>
#include <bitset>

using namespace std;

/* template */

using ll = long long;

void debug_out() { std::cout << std::endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cout << H << " ";
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cout << "debug: "; debug_out(__VA_ARGS__)
#else
#define debug(...) 
#endif

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i< (long long)(n); i++)
#define RRep(i, a, n) for (long long i = ((long long)(n-1ll)); i>=(long long)(a); i--)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()

template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

struct Edge{
    int to;
    ll weight;
    Edge(int t, ll w) : to(t), weight(w){ }
};

struct edge{
    int from;
    int to;
    ll weight;
    edge(int f,int t,ll w) : from(f), to(t), weight(w){ }
};


using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;

template <class T>
inline bool chmin(T &a, T b){
    if (a > b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
inline bool chmax(T &a, T b){
    if (a < b){
        a = b;
        return true;
    }
    return false;
}

template <class T>
T lcm(T a, T b){
    return (a*b)/gcd(a,b);
}

ll ctoi(char c) {
	switch (c) {
	case '0': return 0; case '1': return 1; case '2': return 2;
	case '3': return 3; case '4': return 4; case '5': return 5;
	case '6': return 6; case '7': return 7; case '8': return 8;
	case '9': return 9;  default: return 0;
	}
}

constexpr ll LNF = 1LL<<50;

constexpr int INF = 1e9+7;

const long double PI=3.14159265358979323846;


vector<int> dx = {1,0,-1,1,-1,0};
vector<int> dy = {1,1,1,0,0,-1};

/* template */

int n;

void rotate(vector<int> &x, vector<int> &y, vector<int> &c){
    rep(i,0,n){
        int nx = y[i];
        int ny = 200000-x[i];
        if(c[i]<2){
            c[i] += 2;
        }
        else{
            c[i] %=2;
            c[i]++;
            c[i] %=2;
        }
        x[i] = nx;
        y[i] = ny;
    }
    return;
}

vector<vector<pair<int,int>>> v1,v2;

int solve1(const vector<int> &x,const vector<int> &y, const vector<int> &c){ 
    rep(i,0,200010){
        v1[i].clear();
    }
    rep(i,0,n){
        if(c[i]>1) continue;
        v1[x[i]].emplace_back(pair<int,int>(y[i],c[i]));
    }
    int ans = INF;
    rep(i,0,200010){
        sort(all(v1[i]));
        rep(j,0,v1[i].size()-1){
            if(v1[i][j+1].second-v1[i][j].second==1){
                chmin(ans,5*(v1[i][j+1].first-v1[i][j].first));
            }
        }
    }
    return ans;
}

int solve2(const vector<int> &x,const vector<int> &y, const vector<int> &c){
    rep(i,0,500010){
        v2[i].clear();
    }
    rep(i,0,n){
        if(c[i]%2!=0) continue;
        v2[x[i]+y[i]].emplace_back(pair<int,int>(x[i],c[i]));
    }
    int ans = INF;
    rep(i,0,500010){
        sort(all(v2[i]));
        rep(j,0,v2[i].size()-1){
            auto tmp = v2[i][j];
            auto nxt = v2[i][j+1];
            if(tmp.second-nxt.second!=2) continue;
            chmin(ans,10*(nxt.first-tmp.first));
        }
    }
    return ans;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> n;
    vector<int> x(n),y(n),c(n);
    v1.resize(200010);
    v2.resize(500010);
    rep(i,0,n){
        int p,q; char r; cin >> p >> q >> r;
        x[i] = p; y[i] = q;
        if(r=='U') c[i] = 0;
        else if(r=='D') c[i] = 1;
        else if(r=='R') c[i] = 2;
        else c[i] = 3;
    }
    int ans = INF;
    rep(i,0,4){
        chmin(ans,solve1(x,y,c));
        chmin(ans,solve2(x,y,c));
        rotate(x,y,c);
    }
    if(ans==INF){
        cout << "SAFE" << endl;
        return 0;
    }
    cout << ans << endl;
}

Measured memory_bytes: 34804