/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
 #define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
 #define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1<<19;
int x[SIZE],y[SIZE],d[SIZE];
VPII AA[SIZE];
void my_clear(){
    REP(i,SIZE)AA[i].clear();
}
int an=MOD;
void update(int mul){
    REP(i,SIZE){
        sort(ALL(AA[i]));
        REPP(j,1,SZ(AA[i])){
            if(AA[i][j-1].S==0&&AA[i][j].S==1)an=min(an,(AA[i][j].F-AA[i][j-1].F)*mul);
        }
    }
}
void solve() {
    int N;
    R(N);
    REP(i,N){
        R(x[i],y[i]);
        char c[4];
        RS(c);
        if(c[0]=='U')d[i]=0;
        else if(c[0]=='R')d[i]=1;
        else if(c[0]=='D')d[i]=2;
        else d[i]=3;
    }
    my_clear();
    REP(i,N){
        if(d[i]&1){
            AA[y[i]].PB(MP(x[i],d[i]>>1));
        }
    }
    update(1);
    my_clear();
    REP(i,N){
        if(d[i]%2==0){
            AA[x[i]].PB(MP(y[i],d[i]>>1));
        }
    }
    update(1);
    my_clear();
    REP(i,N){
        if(d[i]==1){
            AA[x[i]+y[i]].PB(MP(x[i],0));
        } else if(d[i] == 0) {
            AA[x[i]+y[i]].PB(MP(x[i],1));
        }
    }
    update(2);
    my_clear();
    REP(i,N){
        if(d[i]==2){
            AA[x[i]+y[i]].PB(MP(x[i],0));
        } else if(d[i] == 3) {
            AA[x[i]+y[i]].PB(MP(x[i],1));
        }
    }
    update(2);
    my_clear();
    REP(i,N){
        if(d[i]==0){
            AA[x[i]-y[i]+200000].PB(MP(x[i],0));
        } else if(d[i] == 3) {
            AA[x[i]-y[i]+200000].PB(MP(x[i],1));
        }
    }
    update(2);
    my_clear();
    REP(i,N){
        if(d[i]==1){
            AA[x[i]-y[i]+200000].PB(MP(x[i],0));
        } else if(d[i] == 2) {
            AA[x[i]-y[i]+200000].PB(MP(x[i],1));
        }
    }
    update(2);
    if(an==MOD)W("SAFE");
    else W(an*5);
}
int main(){
#define MULTITEST 0
#if MULTITEST    
    CASET{
        solve();
    }
#else
    solve();
#endif
    return 0;
}


Measured memory_bytes: 31740