import Control.Monad
import Control.Monad.ST
import Control.Applicative
import Data.List
import Data.Array
import Data.Array.IO
import Data.Array.ST
import Data.Maybe
import Data.Bits
import Data.Ord
import Data.Ratio
import Data.Int
import Data.Char
import qualified Data.ByteString.Char8 as BS
import qualified Data.Set as Set
import Text.Printf
import Debug.Trace
import Numeric

modifyArray arr i f = readArray arr i >>= \x -> writeArray arr i (f x)

listToTuple2 [a,b] = (a,b)
listToTuple3 [a,b,c] = (a,b,c)
listToTuple4 [a,b,c,d] = (a,b,c,d)

getWords = getLine >>= return . words

readIntBS = fst . fromJust . BS.readInt

for = flip map

type Graph = Array Int [Int]

buildGraph :: (Int,Int) -> [(Int,Int)] -> Graph
buildGraph bound dat = runST $ do
  graph <- newArray bound [] :: ST s (STArray s Int [Int])
  forM_ dat $ \(s,e) -> do
    modifyArray graph s (e:)
    modifyArray graph e (s:)
  freeze graph



main :: IO ()
main = do
  n <- readLn :: IO Int
  graph <- buildGraph (1,n) . map (listToTuple2 . map readIntBS . BS.words) . BS.lines <$> BS.getContents :: IO Graph

  let
    dfs :: Int -> Int -> Graph -> Maybe [Int]
    dfs cur par tree
      | cur == n = Just [n]
      | otherwise = if next == [] then Nothing else Just (cur : head next)
        where
          next = catMaybes $ map (\i -> dfs i cur tree) (delete par $ tree!cur)

    (Just chain) = dfs 1 0 graph

    count :: Int -> Int -> Graph -> Int
    count cur par tree = 1 + (sum $ [count i cur tree | i <- tree!cur, i /= par])

    branch [] _ = []
    branch (x:xs) prev = 1 + sum [count i x graph | i <- graph!x, i /= prev, i /= next] : branch xs x
      where next = if null xs then 0 else head xs
    
    (fennec, snuke) = splitAt (div n 2 - 1) $ branch chain 0

  putStrLn $ if sum fennec > sum snuke then "Fennec" else "Snuke"
  
