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.

-----Constraints-----
 - 2 \leq N \leq 10^5
 - 1 \leq a_i, b_i \leq N
 - The given graph is a tree.

-----Input-----
Input is given from Standard Input in the following format:
N
a_1 b_1
:
a_{N-1} b_{N-1}

-----Output-----
If Fennec wins, print Fennec; if Snuke wins, print Snuke.

-----Sample Input-----
7
3 6
1 2
3 1
7 4
5 7
1 4

-----Sample Output-----
Fennec

For example, if Fennec first paints Cell 2 black, she will win regardless of Snuke's moves.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "import heapq\n# v:頂点数, s:始点, path[i]:[[cost,to]...] i=fromの隣接リスト\ndef dijkstra(v,s,path):\n    inf = float('inf')\n\n    # 距離をinfで初期化\n    d = [inf for i in range(v)]\n    d[s] = 0\n\n    # sへの距離は0\n    q = [[0,s]]\n    heapq.heapify(q)\n\n    # 距離が最小の頂点から更新していけば\n    # p[1]から行ける\n    while q:\n        p = heapq.heappop(q)\n\n        # 頂点p[1]までの距離がheapないのp[1]までの距離より小さい場合、continue\n        if d[p[1]]<p[0]:\n            continue\n\n        # 頂点p[1]から伸びる、全ての辺の距離を確認\n        for i in range(len(path[p[1]])):\n            # 頂点p[1]から行ける頂点の距離がp[1]までの距離とp[1]からの距離の和より小さい場合 -> 距離を更新し、heapに追加\n            if d[path[p[1]][i][1]] > d[p[1]] + path[p[1]][i][0]:\n                d[path[p[1]][i][1]] = d[p[1]]+path[p[1]][i][0]\n                heapq.heappush(q,[d[path[p[1]][i][1]], path[p[1]][i][1]])\n    return d\n\ndef path_recovery(e,d,path):\n    # 経路\n    route = [e]\n    # 残りの距離\n    a = d[e]\n    while a!=0:\n        for i in range(len(path[e])):\n            if d[path[e][i][1]]+path[e][i][0]==a:\n                route.append(path[e][i][1])\n                a -= path[e][i][0]\n                e = path[e][i][1]\n                break\n    route.reverse()\n    return route\n\nclass UnionFind:\n    # 初期化\n    def __init__(self, n):\n        # 根なら-size, 子なら親の頂点\n        self.par = [-1] * n\n        # 木の高さ\n        self.rank = [0] * n\n\n    # 検索\n    def find(self, x):\n        if self.par[x] < 0:\n            return x\n        else:\n            self.par[x] = self.find(self.par[x])\n            return self.par[x]\n\n    # 併合\n    def unite(self, x, y):\n        x = self.find(x)\n        y = self.find(y)\n        # 異なる集合に属する場合のみ併合\n        if x != y:\n            # 高い方をxとする。\n            if self.rank[x] < self.rank[y]:\n                x,y = y,x\n            # 同じ高さの時は高さ+1\n            if self.rank[x] == self.rank[y]:\n                self.rank[x] += 1\n            # yの親をxとし、xのサイズにyのサイズを加える\n            self.par[x] += self.par[y]\n            self.par[y] = x\n\n    # 同集合判定\n    def same(self, x, y):\n        return self.find(x) == self.find(y)\n\n    # 集合の大きさ\n    def size(self, x):\n        return -self.par[self.find(x)]\n\nn = int(input())\n\nl = [[] for i in range(n)]\nfor i in range(n-1):\n    a,b = map(int, input().split())\n    # dijkstraのlibraryに合わせるため、距離1を追加\n    l[a-1].append([1,b-1])\n    l[b-1].append([1,a-1])\n\nd = dijkstra(n,0,l)\n\np = path_recovery(n-1,d,l)\n\nx = p[(len(p)-1)//2]\ny = p[(len(p)-1)//2+1]\n\nfor i in range(len(l[x])):\n    if l[x][i][1]==y:\n        l[x].pop(i)\n        break\nfor i in range(len(l[y])):\n    if l[y][i][1]==x:\n        l[y].pop(i)\n        break\n\nu = UnionFind(n)\n\nfor i in range(len(l)):\n    for j in range(len(l[i])):\n        u.unite(i,l[i][j][1])\n\n\nif u.size(0)>u.size(n-1):\n    print('Fennec')\nelse:\n    print('Snuke')"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 17601