#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define mp make_pair
#define pb push_back
#define rep(i,a,n) for(int i=(a);i<=(n);++i)
#define dep(i,a,n) for(int i=(a);i>=(n);--i)
#define eps 1e-8
#define pi 3.1415926535897
#define sqr(x) ((x)*(x))
#define MAX(a,b) a=max(a,b)
#define MIN(a,b) a=min(a,b)
#define SZ(x) ((int)(x).size())
#define CPY(a,b) memcpy(a,b,sizeof(a))
#define CLR(a) memset(a,0,sizeof(a))
#define POSIN(x,y) (1<=(x)&&(x)<=n&&1<=(y)&&(y)<=m)
#define all(x) (x).begin(),(x).end()
#define COUT(S,x) cout<<fixed<<setprecision(x)<<S<<endl
#define buli(x) (__builtin_popcountll(x))
#define bur0(x) (__builtin_ctzll(x))
#define bul2(x) (63-__builtin_clzll(x))
#define pw(x) ((ll(1))<<(x))
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
#define mmo(a,b) (((a)=1ll*(a)*(b)%mo)<0?(a)+=mo:(a))
#define y0 y0z
#define y1 y1z
#define yn ynz
#define j0 j0z
#define j1 j1z
#define jn jnz
#define tm tmz
#ifdef LOCAL
#define debug(...) fprintf(stderr, __VA_ARGS__)
#else
#define debug(...) 
#endif
typedef long long ll;
typedef double lf;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<lf,lf> pff;
typedef complex<double> CD;
const int inf=0x3f3f3f3f;
const int mo=1000000007;
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}
inline void gn(unsigned long long&x){long long t;gn(t);x=t;}
inline void gn(double&x){double t;scanf("%lf",&t);x=t;}
inline void gn(long double&x){double t;scanf("%lf",&t);x=t;}
template<class T1,class T2>inline void gn(T1&r,T2&s){gn(r),gn(s);}
template<class T1,class T2,class T3>inline void gn(T1&r,T2&s,T3&t){gn(r),gn(s),gn(t);}
template<class T1,class T2,class T3,class T4>inline void gn(T1&r,T2&s,T3&t,T4&u){gn(r),gn(s),gn(t),gn(u);}
inline void gs(char *s){scanf("%s",s);}
inline void gc(char &c){while((c=getchar())>126 || c<33);}
inline void pc(char c){putchar(c);}
const int DX[]={1,0,-1,0},DY[]={0,1,0,-1};
ll powmod(ll a,ll b) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll powmod(ll a,ll b,ll mo) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
//*******************************************

const int N=1111111,M=111111;
int l,m,n,t,C;
char s[N];
pii a[N];
int v[N];
map<int,vector<int>>M1,M2,M3,M4;
ll ans;
void work1(map<int,vector<int>>&MA){
	for(auto i:MA){
		vector<pair<int,int>>V;
		for(auto j:i.Y)V.pb(mp(a[j].X,j));
		sort(all(V));
		// if(SZ(V)>1){for(auto i:V)printf("%d %d\n",i.X,i.Y);}
		ll preu=-1ll<<60,prer=-1ll<<60;
		for(auto i:V){
			if(v[i.Y]=='U')preu=i.X;
			if(v[i.Y]=='R')prer=i.X;
			if(v[i.Y]=='D')if(prer>-1ll>>60)MIN(ans,(i.X-prer)*2);
			if(v[i.Y]=='L')if(preu>-1ll>>60)MIN(ans,(i.X-preu)*2);
		}
	}
}
void work2(map<int,vector<int>>&MA){
	for(auto i:MA){
		vector<pair<int,int>>V;
		for(auto j:i.Y)V.pb(mp(a[j].X,j));
		sort(all(V));
		// if(SZ(V)>1){for(auto i:V)printf("%d %d\n",i.X,i.Y);}
		ll preu=-1ll<<60,prer=-1ll<<60;
		for(auto i:V){
			if(v[i.Y]=='D')preu=i.X;
			if(v[i.Y]=='R')prer=i.X;
			if(v[i.Y]=='U')if(prer>-1ll>>60)MIN(ans,(i.X-prer)*2);
			if(v[i.Y]=='L')if(preu>-1ll>>60)MIN(ans,(i.X-preu)*2);
		}
	}
}
void work3(map<int,vector<int>>&MA){
	for(auto i:MA){
		vector<pair<int,int>>V;
		for(auto j:i.Y)V.pb(mp(a[j].Y,j));
		sort(all(V));
		ll preu=-1ll<<60;
		for(auto i:V){
			if(v[i.Y]=='U')preu=i.X;
			if(v[i.Y]=='D')if(preu>-1ll>>60)MIN(ans,i.X-preu);
		}
	}
}
void work4(map<int,vector<int>>&MA){
	for(auto i:MA){
		vector<pair<int,int>>V;
		for(auto j:i.Y)V.pb(mp(a[j].X,j));
		sort(all(V));
		ll preu=-1ll<<60;
		for(auto i:V){
			if(v[i.Y]=='R')preu=i.X;
			if(v[i.Y]=='L')if(preu>-1ll>>60)MIN(ans,i.X-preu);
		}
	}
}
int main(){
#ifdef LOCAL
	freopen("F.in","r",stdin);//freopen("F.out","w",stdout);
#endif
	scanf("%d",&n);
	rep(i,1,n){
		scanf("%d%d%s",&a[i].X,&a[i].Y,s);
		M1[a[i].X-a[i].Y].pb(i);
		M2[a[i].X+a[i].Y].pb(i);
		M3[a[i].X].pb(i);
		M4[a[i].Y].pb(i);
		v[i]=s[0];
	}
	ans=1ll<<60;
	work1(M1);
	// cout<<ans<<endl;
	work2(M2);
	// cout<<ans<<endl;
	work3(M3);
	// cout<<ans<<endl;
	work4(M4);
	if(ans>1ll<<59){puts("SAFE");return 0;}
	printf("%lld\n",ans*5);
	return 0;
}


Measured memory_bytes: 74088