from networkx import*

(N,),*t=[s.split()for s in open(0)]

G=Graph()

for a,b in t:G.add_edge(a,b)

s=shortest_path_length

x=s(G,'1')

y=s(G,N)

c=0

for k in y:c+=x[k]>y[k]

print(('FSennunkeec'[c*2>=int(N)::2]))
from networkx import*

N,*t=open(0)

G=Graph()

for s in t:a,b=s.split();G.add_edge(a,b)

s=shortest_path_length

x=s(G,'1')

y=s(G,N[:-1])

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

(N,), *t = [s.split() for s in open(0)]
G = Graph()
for a, b in t:
    G.add_edge(a, b)
s = shortest_path_length
x = s(G, "1")
y = s(G, N)
c = 0
for k in y:
    c += x[k] > y[k]
print(("FSennunkeec"[c * 2 >= int(N) :: 2]))

from networkx import *

N, *t = open(0)
G = Graph()
for s in t:
    a, b = s.split()
    G.add_edge(a, b)
s = shortest_path_length
x = s(G, "1")
y = s(G, N[:-1])
print(("FSennunkeec"[sum(x[k] > y[k] for k in x) * 2 >= int(N) :: 2]))

-(N,), *t = [s.split() for s in open(0)] +N, *t = open(0) -for a, b in t: +for s in t: +    a, b = s.split() -y = s(G, N) -c = 0 -for k in y: -    c += x[k] > y[k] -print(("FSennunkeec"[c * 2 >= int(N) :: 2])) +y = s(G, N[:-1]) +print(("FSennunkeec"[sum(x[k] > y[k] for k in x) * 2 >= int(N) :: 2]))