output_description: If Fennec wins, print `Fennec`; if Snuke wins, print `Snuke`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 b_1
      :
      a_{N-1} b_{N-1}
attempt: n=int(input())
  s=[[]for i in range(n+1)]
  for i in range(n-1):
      a,b=map(int,input().split())
      s[a].append(b)
      s[b].append(a)
  def f(a,b):
      c,flag,ans=[[a,[0,a]]],False,[]
      while c or flag=False:
          p,q=c.pop()
          for i in s[p]:
              if i==b:
                  ans=q[1:]+[b]
                  break
              else:
                  if q[-2]!=i:
                      c.append([i,q+[i]])
      else:
          return ans
  def f(x,l):
      c=0
      p,d=[x],[0]*(n+1)
      while p:
          a=p.pop()
          if a not in x or a==x:
              c+=1
              d[a]=1
              for i in s[a]:
                  if d[i]==0:
                      p.append(i)
      else:
          return c
  t=f(a,b)
  t=[f(i,ans)for i in t]
  print("Fennec"if sum(t[:-len(t)//2])>sum(t[-len(t)//2:]) else"Snuke")
problem_description: Statement
  
  Fennec and Snuke are playing a board game.
  
  On the board, there are N cells numbered 1 through N, and N-1 roads, each
  connecting two cells. Cell a_i is adjacent to Cell b_i through the i-th road.
  Every cell can be reached from every other cell by repeatedly traveling to an
  adjacent cell. In terms of graph theory, the graph formed by the cells and the
  roads is a tree.
  
  Initially, Cell 1 is painted black, and Cell N is painted white. The other
  cells are not yet colored. Fennec (who goes first) and Snuke (who goes second)
  alternately paint an uncolored cell. More specifically, each player performs
  the following action in her/his turn:
  
    * Fennec: selects an uncolored cell that is adjacent to a **black** cell, and paints it **black**.
    * Snuke: selects an uncolored cell that is adjacent to a **white** cell, and paints it **white**.
  
  A player loses when she/he cannot paint a cell. Determine the winner of the
  game when Fennec and Snuke play optimally.
samples: [{"input": "7\n    3 6\n    1 2\n    3 1\n    7 4\n    5 7\n    1 4", "output": "Fennec\n    \n\nFor example, if Fennec first paints Cell 2 black, she will win regardless of\nSnuke's moves.\n\n* * *"}, {"input": "4\n    1 4\n    4 2\n    2 3", "output": "Snuke"}]