import qualified Data.ByteString.Char8 as B
import Data.Maybe
import Data.IntMap.Strict ((!))
import qualified Data.IntMap.Strict as M
import Data.List

data Player = Fennec | Snuke deriving (Eq,Show)

readPair = (\[a,b] -> [(a,b),(b,a)]) . map (fst . fromJust . B.readInt) . B.words

main = do
 n <- readLn
 es <- concatMap readPair . B.lines <$> B.getContents
 let g = foldr (\(a,b) im -> M.insertWith (++) a [b] im) M.empty es
 print (vs n g)

vs n g = if nf >= ns then Fennec else Snuke
 where
  nf = dfs g 0 1 n 0
  ns = dfs g 0 n 1 0

dfs g px sx gx acc
 | sx == gx = acc
 | null next = acc
 | otherwise = sum $ map (\nx -> dfs g sx nx gx (acc+1)) next
 where
  next = delete px (g!sx)