import java.util.Scanner
import Math.max

object Main extends App {
  val sc = new Scanner(System.in)

  val fene = "Fennec"
  val snuke = "Snuke"

  val N = sc.nextInt()
  val edges = Array.fill[List[Int]](N+1)(Nil)
  for (_ <- 1 to N-1) {
    val a, b = sc.nextInt()
    edges(a) = b :: edges(a)
    edges(b) = a :: edges(b)
  }


  //
  sealed trait Color
  case object B extends Color
  case object W extends Color

  val q = new scala.collection.mutable.Queue[(Int, Color)]
  val dp = new Array[Boolean](N+1)

  dp(1) = true; dp(N) = true

  for(e <- edges(1)) {
    q.enqueue((e, B))
  }
  for(e <- edges(N)) {
    q.enqueue((e, W))
  }

  var fenScore = 0; var snuScore = 0
  while(!q.isEmpty) {
    val (node, color) = q.dequeue
    if (!dp(node)) {
      dp(node) = true
      color match {
        case B => fenScore += 1
        case W => snuScore += 1
      }

      for(e <- edges(node)) {
        q.enqueue((e, color))
      }
    }
  }

  if(fenScore > snuScore)
    println(fene)
  else
    println(snuke)

}
