package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"math"
	"os"
	"sort"
	"strconv"
)

var DEBUG = true

type P struct {
	X, Y int
	U    string
}

func main() {
	main1()
}

func main0() {
	defer Flush()
	N := readi()
	A := make([]P, N)
	for i := range A {
		A[i].X = readi()
		A[i].Y = readi()
		A[i].U = reads()
	}

	ans := math.MaxInt64
	for i, p := range A {
		for j := i + 1; j < N; j++ {
			q := A[j]
			if p.X == q.X {
				if p.Y < q.Y && p.U == "U" && q.U == "D" {
					ans = min(ans, (q.Y-p.Y)*5)
				}
				if p.Y > q.Y && p.U == "D" && q.U == "U" {
					ans = min(ans, (p.Y-q.Y)*5)
				}
			}
			if p.Y == q.Y {
				if p.X < q.X && p.U == "R" && q.U == "L" {
					ans = min(ans, (q.X-p.X)*5)
				}
				if p.X > q.X && p.U == "L" && q.U == "R" {
					ans = min(ans, (p.X-q.X)*5)
				}
			}
			if p.Y+p.X == q.Y+q.Y {
				if p.X < q.X && (p.U == "R" && q.U == "U" || p.U == "D" && q.U == "L") {
					ans = min(ans, (q.X-p.X)*5)
				}
				if p.X > q.X && (q.U == "R" && p.U == "U" || q.U == "D" && p.U == "L") {
					ans = min(ans, (p.X-q.X)*5)
				}
			}
			if p.Y-p.X == q.Y-q.Y {
				if p.X < q.X && (p.U == "U" && q.U == "L" || p.U == "R" && q.U == "D") {
					ans = min(ans, (q.X-p.X)*5)
				}
				if p.X > q.X && (q.U == "U" && p.U == "L" || q.U == "R" && p.U == "D") {
					ans = min(ans, (p.X-q.X)*5)
				}
			}
		}
	}

	if ans == math.MaxInt64 {
		println("SAFE")
	} else {
		println(ans)
	}
}

func main1() {
	defer Flush()
	N := readi()

	A := make([]P, N)
	for i := range A {
		A[i].X = readi()
		A[i].Y = readi()
		A[i].U = reads()
	}

	ma := make(map[int]map[string][]P)
	mb := make(map[int]map[string][]P)
	mh := make(map[int]map[string][]P)
	mv := make(map[int]map[string][]P)
	for _, p := range A {
		ya := p.Y + p.X
		add(ma, ya, p)
		yb := p.Y - p.X
		add(mb, yb, p)
		add(mh, p.Y, p)
		add(mv, p.X, p)
	}

	ans := math.MaxInt64

	for _, a := range ma {
		for _, dir := range []string{"U", "D", "R", "L"} {
			c, ok := a[dir]
			if !ok {
				continue
			}
			sort.Slice(c, func(i, j int) bool {
				return c[i].X < c[j].X
			})
		}

		u := a["U"]
		r := a["R"]
		if len(u) != 0 && len(r) != 0 {
			for _, p := range r {
				j := sort.Search(len(u), func(i int) bool {
					return p.X < u[i].X
				})
				if j == len(u) {
					continue
				}
				//dbg("ma UR found", u[j], "for", p)
				c := (u[j].X - p.X) * 10
				ans = min(ans, c)
			}
		}

		d := a["D"]
		l := a["L"]
		if len(d) != 0 && len(l) != 0 {
			for _, p := range d {
				j := sort.Search(len(l), func(i int) bool {
					return p.X < l[i].X
				})
				if j == len(l) {
					continue
				}
				//dbg("ma DL found", l[j], "for", p)
				c := (l[j].X - p.X) * 10
				ans = min(ans, c)
			}
		}
	}

	for _, a := range mb {
		for _, dir := range []string{"U", "D", "R", "L"} {
			c, ok := a[dir]
			if !ok {
				continue
			}
			sort.Slice(c, func(i, j int) bool {
				return c[i].X < c[j].X
			})
		}

		u := a["U"]
		l := a["L"]
		if len(u) != 0 && len(l) != 0 {
			for _, p := range u {
				j := sort.Search(len(l), func(i int) bool {
					return p.X < l[i].X
				})
				if j == len(l) {
					continue
				}
				//dbg("mb UL found", l[j], "for", p)
				c := (l[j].X - p.X) * 10
				ans = min(ans, c)
			}
		}

		d := a["D"]
		r := a["R"]
		if len(d) != 0 && len(r) != 0 {
			for _, p := range r {
				j := sort.Search(len(d), func(i int) bool {
					return p.X < d[i].X
				})
				if j == len(d) {
					continue
				}
				//dbg("mb DR found", d[j], "for", p)
				c := (d[j].X - p.X) * 10
				ans = min(ans, c)
			}
		}
	}

	for _, a := range mh {
		for _, dir := range []string{"L", "R"} {
			c, ok := a[dir]
			if !ok {
				continue
			}
			sort.Slice(c, func(i, j int) bool {
				return c[i].X < c[j].X
			})
		}

		l := a["L"]
		r := a["R"]
		if len(r) != 0 && len(l) != 0 {
			for _, p := range r {
				j := sort.Search(len(l), func(i int) bool {
					return p.X < l[i].X
				})
				if j == len(l) {
					continue
				}
				//dbg("mh LR found", l[j], "for", p)
				c := (l[j].X - p.X) * 5
				ans = min(ans, c)
			}
		}
	}

	for _, a := range mv {
		for _, dir := range []string{"U", "D"} {
			c, ok := a[dir]
			if !ok {
				continue
			}
			sort.Slice(c, func(i, j int) bool {
				return c[i].Y < c[j].Y
			})
		}

		u := a["U"]
		d := a["D"]
		if len(u) != 0 && len(d) != 0 {
			for _, p := range u {
				j := sort.Search(len(d), func(i int) bool {
					return p.Y < d[i].Y
				})
				if j == len(d) {
					continue
				}
				//dbg("mv UD found", d[j], "for", p)
				c := (d[j].Y - p.Y) * 5
				ans = min(ans, c)
			}
		}
	}

	if ans == math.MaxInt64 {
		println("SAFE")
	} else {
		println(ans)
	}
}

func add(m map[int]map[string][]P, y int, p P) {
	mm, ok := m[y]
	if !ok {
		mm = make(map[string][]P)
		m[y] = mm
	}
	mm[p.U] = append(mm[p.U], p)
}

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

func readberr() ([]byte, error) {
	b, err := nextToken()
	return b[:len(b):len(b)], err
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

func readserr() (string, error) {
	b, err := readberr()
	return string(b), err
}

// Read next line as []byte.  Trailing '\n' will not be included.
// See also comments on readb()
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b[:len(b):len(b)]
}

func readblnerr() ([]byte, error) {
	b, err := nextLine()
	return b[:len(b):len(b)], err
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

func readslnerr() (string, error) {
	b, err := readblnerr()
	return string(b), err
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

func readllerr() (int64, error) {
	s, err := readserr()
	if err != nil {
		return 0, fmt.Errorf("reading string: %w", err)
	}

	i, err := strconv.ParseInt(s, 10, 64)
	if err != nil {
		return 0, fmt.Errorf("parsing int: %w", err)
	}

	return i, nil
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

func readierr() (int, error) {
	i, err := readllerr()
	return int(i), err
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

func readferr() (float64, error) {
	s, err := readserr()
	if err != nil {
		return 0, fmt.Errorf("reading string: %w", err)
	}

	f, err := strconv.ParseFloat(s, 64)
	if err != nil {
		return 0, fmt.Errorf("parsing float: %w", err)
	}

	return f, nil
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

func dbgf(f string, args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintf(os.Stderr, f, args...)
}

func dbg(args ...interface{}) {
	if !DEBUG {
		return
	}
	fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Utilities

func sumSlice(a []int) int {
	var res int
	for _, v := range a {
		res += v
	}
	return res
}

func sumSlicell(a []int64) int64 {
	var res int64
	for _, v := range a {
		res += v
	}
	return res
}

func readInts(N int) (int, []int) {
	if N == 0 {
		N = readi()
	}
	a := make([]int, N)
	for i := range a {
		a[i] = readi()
	}
	return N, a
}

func readIntsll(N int) (int, []int64) {
	if N == 0 {
		N = readi()
	}
	a := make([]int64, N)
	for i := range a {
		a[i] = readll()
	}
	return N, a
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func minf(a, b float64) float64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func maxf(a, b float64) float64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

func absf(a float64) float64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}


Measured memory_bytes: 350080