#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<int, pair<int, int>> PP;
typedef pair<P, int> PPi;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define chadd(x, y) x = (x + y) % mod

template<typename G>
struct LCA{
    const int ub_log;
    vector<int> depth;
    const G &g;
    vector<vector<int>> table;

    LCA(const G &g) : g(g), depth(g.size()), ub_log(32 - __builtin_clz(g.size())){
        table.assign(ub_log, vector<int>(g.size(), -1));
    }

    // 親番号と深さを dfs で求める
    void dfs(int from, int par = -1, int dep = 0){
        table[0][from] = par;
        depth[from] = dep;
        for(auto &to : g[from]){
            if(to != par)   dfs(to, from, dep + 1);
        }
    }

    void build(int root = 0){
        dfs(root);
        for(int k = 0; k + 1 < ub_log; ++k){
            for(int i = 0; i < table[k].size(); ++i){
                if(table[k][i] == -1)   table[k + 1][i] = -1;
                // 頂点 i の 2^(k+1) 先にある頂点
                // = (頂点 i の 2^k 先の頂点) の 2^k 先にある頂点
                else    table[k + 1][i] = table[k][table[k][i]];
            }
        }
    }

    // u と v の LCA
    int query(int u, int v){
        if(depth[u] > depth[v]) swap(u, v);
        
        // u と v の depth を同じにする
        for(int i = ub_log - 1; i >= 0; --i){
            if(((depth[v] - depth[u]) >> i) & 1)    v = table[i][v];
        }
        if(u == v)  return u;

        for(int i = ub_log - 1; i >= 0; --i){
            // 2^i 個辿った頂点が異なるとき
            if(table[i][u] != table[i][v]){
                // LCA に到達していないので、(u, v) をその頂点に置き換える。
                u = table[i][u];
                v = table[i][v];
            }
        }
        return table[0][u];
    }

    int length(int u, int v){
        int lca = query(u, v);
        return depth[u] + depth[v] - depth[lca] * 2;
    }

    void print(){
        for(int k = 0; k + 1 < ub_log; ++k){
            for(int i = 0; i < table[k].size(); ++i){
                cerr << table[k][i] << " ";
            }
            cerr << "\n";
        }
    }
};

using G = vector<vector<int>>;
G graph;
int black, white;

int dfs(int from, int p = -1){
    int res = 1;
    for(int to : graph[from]){
        if(to == p || to == white)  continue;
        res += dfs(to, from);
    }
    return res;
}

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

    int n;
    cin >> n;
    graph.resize(n);
    for(int i = 0; i < n - 1; ++i){
        int a, b;
        cin >> a >> b;
        --a, --b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    LCA<G> lca(graph);
    lca.build();
    int diameter = lca.length(0, n - 1);
    int dist = diameter / 2;
    if(diameter % 2 == 0){
        int x = dist;
        black = n - 1;
        for(int i = lca.ub_log - 1; i >= 0; --i){
            if((x >> i) & 1)    black = lca.table[i][black];
        }
        x = dist - 1;
        white = n - 1;
        for(int i = lca.ub_log - 1; i >= 0; --i){
            if((x >> i) & 1)    white = lca.table[i][white];
        }
    }
    else{
        int x = dist;
        white = n - 1;
        for(int i = lca.ub_log - 1; i >= 0; --i){
            if((x >> i) & 1)    white = lca.table[i][white];
        }
        x = dist + 1;
        black = n - 1;
        for(int i = lca.ub_log - 1; i >= 0; --i){
            if((x >> i) & 1)    black = lca.table[i][black];
        }
    }
    int cnt = dfs(black);
    bool win = (cnt > n - cnt) ? true : false;
    if(win) cout << "Fennec\n";
    else    cout << "Snuke\n";
}

Measured memory_bytes: 15864