// ${url}
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

const INF: i64 = 1e16 as i64;

type Plane = (i64, i64, char);

fn find<F>(up: Vec<Plane>, dw: Vec<Plane>, grouping_fn: F) -> i64 where F: Fn(Plane) -> (i64, i64) {
    let mut up = up.into_iter().map(|u| grouping_fn(u)).collect::<Vec<_>>();
    let mut dw = dw.into_iter().map(|u| grouping_fn(u)).collect::<Vec<_>>();
    let n = up.len();
    let m = dw.len();
    let mut best = INF;
    up.sort();
    dw.sort();
    let mut di = 0;
    let mut ui = 0;
    while ui < n {
        let mut bt = BTreeSet::new();
        while di < m && dw[di].0 <= up[ui].0 {
            if dw[di].0 == up[ui].0 {
                bt.insert(dw[di].1);
            }
            di += 1;
        }
        let x = up[ui].0;
        while ui < n && up[ui].0 == x {
            let y = up[ui].1;
            if let Some(&xt) = bt.range(y..).next() {
                best = min(best, xt-y);
            }
            ui += 1;
        }
        // debug!(ui, di);
    }
    best
}


fn main() {
    input! {
        n: usize,
        a: [(i64, i64, char); n]
    };
    let up = a.iter().cloned().filter(|w| w.2 == 'U').collect::<Vec<_>>();
    let down = a.iter().cloned().filter(|w| w.2 == 'D').collect::<Vec<_>>();
    let left = a.iter().cloned().filter(|w| w.2 == 'L').collect::<Vec<_>>();
    let right = a.iter().cloned().filter(|w| w.2 == 'R').collect::<Vec<_>>();


    let mut ans = INF;
    ans = min(ans, find(up.clone(), down.clone(), |p| (p.0, p.1)));
    ans = min(ans, find(right.clone(), left.clone(), |p| (p.1, p.0)));
    ans = min(ans, find(up.clone(), right.clone(), |p| (p.0+p.1, p.1))*2);
    ans = min(ans, find(up.clone(), left.clone(), |p| (p.0-p.1, p.1))*2);
    ans = min(ans, find(down.clone(), right.clone(), |p| (p.0-p.1, -p.0))*2);
    ans = min(ans, find(down.clone(), left.clone(), |p| (p.0+p.1, p.0))*2);

    if ans >= INF {
        println!("SAFE");
    } else {
        println!("{}", ans*5);
    }
}


Measured memory_bytes: 22072