from networkx import*

(N,),*t=list(map(str.split,open(0)))

x,y=[shortest_path_length(Graph(t),v)for v in('1',N)]

print(('FSennunkeec'[sum(x[k]>y[k]for k in x)*2>=int(N)::2]))
from networkx import*

N,*t=list(map(str.split,open(0)))

s=shortest_path_length

x=s(G:=Graph(t),'1')

y=s(G,*N)

print(('FSennunkeec'[sum(x[k]>y[k]for k in x)*2>=len(x)::2]))
from networkx import *

(N,), *t = list(map(str.split, open(0)))
x, y = [shortest_path_length(Graph(t), v) for v in ("1", N)]
print(("FSennunkeec"[sum(x[k] > y[k] for k in x) * 2 >= int(N) :: 2]))

from networkx import *

N, *t = list(map(str.split, open(0)))
s = shortest_path_length
x = s(G := Graph(t), "1")
y = s(G, *N)
print(("FSennunkeec"[sum(x[k] > y[k] for k in x) * 2 >= len(x) :: 2]))

-(N,), *t = list(map(str.split, open(0))) -x, y = [shortest_path_length(Graph(t), v) for v in ("1", N)] -print(("FSennunkeec"[sum(x[k] > y[k] for k in x) * 2 >= int(N) :: 2])) +N, *t = list(map(str.split, open(0))) +s = shortest_path_length +x = s(G := Graph(t), "1") +y = s(G, *N) +print(("FSennunkeec"[sum(x[k] > y[k] for k in x) * 2 >= len(x) :: 2]))