use std::cmp::*;
use input_mcr::*;
use std::collections::HashMap;

fn main() {
    input! {
        n: usize,
        zs: [(i64,i64,char_); n],
    }
    let inf = 1i64 << 50;
    // U -> 0
    // R -> 1
    // D -> 2
    // L -> 3
    let mut xs = vec![vec![]; 4];
    for &(x,y,d) in &zs {
        match d {
            'U' => xs[0].push((x,y)),
            'R' => xs[1].push((x,y)),
            'D' => xs[2].push((x,y)),
            'L' => xs[3].push((x,y)),
            _ => panic!(),
        }
    }
    let mut res = inf;
    eprintln!("degree = 180");
    for i in 0..2 {
        let k = i + 2;
        let mut yss = HashMap::new();
        if i == 0 {
            for &(x,y) in &xs[i] {
                yss.entry(x).or_insert(vec![]).push((y,0));
            }
            for &(x,y) in &xs[k] {
                yss.entry(x).or_insert(vec![]).push((y,1));
            }
        } else {
            for &(x,y) in &xs[i] {
                yss.entry(y).or_insert(vec![]).push((x,0));
            }
            for &(x,y) in &xs[k] {
                yss.entry(y).or_insert(vec![]).push((x,1));
            }
        }
        for (_, ys) in yss.iter_mut() {
            ys.sort();
            let mut prev = -inf;
            for &(z,d) in ys.iter() {
                if d == 0 {
                    prev = z;
                }
                if d == 1 {
                    let t = (z-prev).abs() * 10 / 2;
                    eprintln!("t = {:?}", t);
                    res = min(res, t);
                }
            }
        }
    }
    eprintln!("degree = 90");
    for i in 0..4 {
        eprintln!("i = {}", i);
        let k = (i + 1) % 4;
        let mut yss = HashMap::new();
        if i == 0 || i == 2 {
            for (x,y) in &xs[i] {
                yss.entry(x+y).or_insert(vec![]).push((x-y,0));                
            }
            for (x,y) in &xs[k] {
                yss.entry(x+y).or_insert(vec![]).push((x-y,1));
            }
        } else {
            for (x,y) in &xs[i] {
                yss.entry(x-y).or_insert(vec![]).push((x+y,0));                
            }
            for (x,y) in &xs[k] {
                yss.entry(x-y).or_insert(vec![]).push((x+y,1));
            }
        }
        for (w, ys) in yss.iter_mut() {
            ys.sort();
            let mut prev = -inf;
            for &(z,d) in ys.iter() {
                if i == 1 || i == 2 {
                    if d == 0 {
                        prev = z;
                    }
                    if d == 1 {
                        let t = (z-prev).abs() * 5;
                        eprintln!("t = {:?}", t);
                        res = min(res, t);
                    }
                } else {
                    if d == 1 {
                        prev = z;
                    }
                    if d == 0 {
                        let t = (z-prev).abs() * 5;
                        eprintln!("t = {:?}", t);
                        res = min(res, t);
                    }
                }
            }
        }
    }
    if res == inf {
        println!("SAFE");
    } else {
        println!("{}", res);
    }
}
pub mod input_mcr {
    // ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
    #[macro_export(local_inner_macros)]
    macro_rules! input {
        (source = $s:expr, $($r:tt)*) => {
            let mut parser = Parser::from_str($s);
            input_inner!{parser, $($r)*}
        };
        (parser = $parser:ident, $($r:tt)*) => {
            input_inner!{$parser, $($r)*}
        };
        (new_stdin_parser = $parser:ident, $($r:tt)*) => {
            let stdin = std::io::stdin();
            let reader = std::io::BufReader::new(stdin.lock());
            let mut $parser = Parser::new(reader);
            input_inner!{$parser, $($r)*}
        };
        ($($r:tt)*) => {
            input!{new_stdin_parser = parser, $($r)*}
        };
    }
    
    #[macro_export(local_inner_macros)]
    macro_rules! input_inner {
        ($parser:ident) => {};
        ($parser:ident, ) => {};
        ($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
            let $var = read_value!($parser, $t);
            input_inner!{$parser $($r)*}
        };
    }
    
    #[macro_export(local_inner_macros)]
    macro_rules! read_value {
        ($parser:ident, ( $($t:tt),* )) => {
            ( $(read_value!($parser, $t)),* )
        };
        ($parser:ident, [ $t:tt ; $len:expr ]) => {
            (0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
        };
        ($parser:ident, chars) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()
        };
        ($parser:ident, char_) => {
            read_value!($parser, String).chars().collect::<Vec<char>>()[0]
        };
        ($parser:ident, usize1) => {
            read_value!($parser, usize) - 1
        };
        ($parser:ident, line) => {
            $parser.next_line()
        };
        ($parser:ident, line_) => {
            $parser.next_line().chars().collect::<Vec<char>>()
        };
        ($parser:ident, $t:ty) => {
            $parser.next::<$t>().expect("Parse error")
        };
    }
    
    use std::io;
    use std::io::BufRead;
    use std::str;
    use std::collections::VecDeque;
    
    pub struct Parser<R> {
        pub reader: R,
        buf: VecDeque<u8>,
        parse_buf: Vec<u8>,
    }
    
    impl Parser<io::Empty> {
        pub fn from_str(s: &str) -> Parser<io::Empty> {
            Parser {
                reader: io::empty(),
                buf: VecDeque::from(s.as_bytes().to_vec()),
                parse_buf: vec![],
            }
        }
    }
    
    impl<R: BufRead> Parser<R> {
        pub fn new(reader: R) -> Parser<R> {
            Parser {
                reader: reader,
                buf: VecDeque::new(),
                parse_buf: vec![],
            }
        }
        pub fn update_buf(&mut self) {
            loop {
                let (len, complete) = {
                    let buf2 = self.reader.fill_buf().unwrap();
                    self.buf.extend(buf2.iter());
                    let len = buf2.len();
                    (len, buf2.last() < Some(&0x20))
                };
                self.reader.consume(len);
                if complete {
                    break;
                }
            }
        }
        pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c > 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c <= 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.parse::<T>();
                }
            }
        }
        pub fn next_line(&mut self) -> String {
            loop {
                while let Some(c) = self.buf.pop_front() {
                    if c >= 0x20 {
                        self.buf.push_front(c);
                        break;
                    }
                }
                self.parse_buf.clear();
                while let Some(c) = self.buf.pop_front() {
                    if c < 0x20 {
                        self.buf.push_front(c);
                        break;
                    } else {
                        self.parse_buf.push(c);
                    }
                }
                if self.parse_buf.is_empty() {
                    self.update_buf();
                } else {
                    return unsafe { str::from_utf8_unchecked(&self.parse_buf) }.to_string();
                }
            }
        }
    }
}



Measured memory_bytes: 39220