#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL<<(n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;


void dfs(int node, vector<int> &pre, const vector<vector<int>> &graph) {
    for(auto n : graph.at(node)) {
        if (pre.at(n) == -1) {
            pre.at(n) = node;
            dfs(n, pre, graph);
        }
    }
}

int main() {
    cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;

	vector<vector<int>> graph(N);
	FOR(_, 0, N - 1) {
	    int a, b;
	    cin >> a >> b;
	    a--; b--;
	    graph[a].emplace_back(b);
	    graph[b].emplace_back(a);
	}

    vector<int> pre(N, -1);
	dfs(N - 1, pre, graph);
    vector<int> route;
    int now = 0;
    while (now != N - 1) {
        route.emplace_back(now);
        now = pre.at(now);
    }
    route.emplace_back(N - 1);

    vector<int> color(N, -1);
    FOR(i, 0, route.size()) {
        if (i < ceil((int)route.size(), 2)) {
            color.at(route.at(i)) = 1;
        }
        else {
            color.at(route.at(i)) = 0;
        }
    }

    queue<int> que;
    FOE(n, route) {
        if (color[n] == 1) {
            que.emplace(n);
        }
    }

    while (not que.empty()) {
        int n = que.front(); que.pop();

        FOE(node, graph.at(n)) {
            if (color.at(node) == -1) {
                color.at(node) = 1;
                que.push(node);
            }
        }
    }

    int f = 0;
    FOE(c, color) {
        f += (c == 1);
    }

    int s = N - f;

    if (f > s) {
        print("Fennec");
    }
    else {
        print("Snuke");
    }

	return 0;
}

Measured memory_bytes: 11768