module IntSet = Set.Make (struct type t = int let compare = compare end)

let rec solve e us vs =
  IntSet.exists (fun v ->
    List.exists (fun v' ->
      not (IntSet.mem v' vs) &&
      not (IntSet.mem v' us) &&
      not (solve e (IntSet.add v' vs) us)) (e v)) vs

let () =
  let n = Scanf.scanf "%d\n" (fun n -> n) in
  let abs = Array.init (n - 1)
    (fun _ -> Scanf.scanf "%d %d\n" (fun a b -> a, b)) in 
  solve
    (let e = Array.make n [] in
     Array.iter (fun (a, b) ->
       e.(a - 1) <- b - 1 :: e.(a - 1);
       e.(b - 1) <- a - 1 :: e.(b - 1)) abs;
     fun v -> e.(v))
    (IntSet.singleton (n - 1))
    (IntSet.singleton 0)
  |> (function true -> "Fennec" | false -> "Snuke")
  |> print_endline