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 = 'from collections import defaultdict\nfrom heapq import heappop, heappush\n\n\nclass Graph(object):\n    """\n    隣接リストによる有向グラフ\n    """\n\n    def __init__(self):\n        self.graph = defaultdict(list)\n\n    def __len__(self):\n        return len(self.graph)\n\n    def add_edge(self, src, dst, weight=1):\n        self.graph[src].append((dst, weight))\n\n    def get_nodes(self):\n        return self.graph.keys()\n\n\nclass Dijkstra(object):\n    """\n    ダイクストラ法（二分ヒープ）による最短経路探索\n    計算量: O((E+V)logV)\n    """\n\n    def __init__(self, graph, start):\n        self.g = graph.graph\n\n        # startノードからの最短距離\n        # startノードは0, それ以外は無限大で初期化\n        self.dist = defaultdict(lambda: float(\'inf\'))\n        self.dist[start] = 0\n\n        # 最短経路での1つ前のノード\n        self.prev = defaultdict(lambda: None)\n\n        # startノードをキューに入れる\n        self.Q = []\n        heappush(self.Q, (self.dist[start], start))\n\n        while self.Q:\n            # 優先度（距離）が最小であるキューを取り出す\n            dist_u, u = heappop(self.Q)\n            if self.dist[u] < dist_u:\n                continue\n            for v, weight in self.g[u]:\n                alt = dist_u + weight\n                if self.dist[v] > alt:\n                    self.dist[v] = alt\n                    self.prev[v] = u\n                    heappush(self.Q, (alt, v))\n\n    def shortest_distance(self, goal):\n        """\n        startノードからgoalノードまでの最短距離\n        """\n        return self.dist[goal]\n\n    def shortest_path(self, goal):\n        """\n        startノードからgoalノードまでの最短経路\n        """\n        path = []\n        node = goal\n        while node is not None:\n            path.append(node)\n            node = self.prev[node]\n        return path[::-1]\n\n\ng = Graph()\n#N, M = [int(i) for i in input().split()]\nN = int(input())\n\nfor i in range(N-1):\n    u, v = [int(i) for i in input().split()]\n    g.add_edge(u-1, v-1, 1)\n    g.add_edge(v-1, u-1, 1)\n\nd1 = Dijkstra(g, 0)\nd2 = Dijkstra(g, N-1)\n\nans = 0\n\n#print(d1.dist)\n#print(d2.dist)\n\nfor i in range(N):\n    if d1.dist[i] <= d2.dist[i]:\n        ans += 1\n\nif ans > N - ans:\n    print("Fennec")\nelse:\n    print("Snuke")'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 20645