#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>

#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
#define EACH(i,c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x)  cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR 
#endif
using namespace std;

using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;

//struct edge {int from, to, cost;};

constexpr double EPS = 1e-10;
constexpr double PI  = acos(-1.0);
//constexpr int INF = INT_MAX;

template<class T> inline T sqr(T x) {return x*x;}

int main() {
    int n;
    cin >> n;
    //VP p(2*n-2);
    int a,b;
    VVI dis(2, VI(n+1));
    VVI p(n+1, VI());
    REP(i,0,n-1) {
        cin >> a >> b;
        p[a].push_back(b);
        p[b].push_back(a);
    }
    {
        deque<int> d;
        d.push_back(1);
        while (!d.empty()) {
            int v = *(d.begin());
            d.pop_front();
            for (const auto &i: p[v]) {
                if (dis[0][i] != 0) continue;
                dis[0][i] = dis[0][v] + 1;
                d.push_back(i);
            }
        }
    }
    {
        deque<int> d;
        d.push_back(n);
        while (!d.empty()) {
            int v = *(d.begin());
            d.pop_front();
            for (const auto &i: p[v]) {
                if (dis[1][i] != 0) continue;
                dis[1][i] = dis[1][v] + 1;
                d.push_back(i);
            }
        }
    }
    /*
    REP(i,0,n-1) {
        cin >> a >> b;
        p[2*i] = MP(a,b);
        p[2*i+1] = MP(b,a);
    }
    sort(all(p));

    {
        deque<int> d;
        d.push_back(1);
        auto it = p
        while (!d.empty()) {
            int v = *(d.begin());
            d.pop_front();
            auto it = find_if(all(p), [&](PII &n){return n.first == v;});
            for (;it != p.end() && it->first == v;++it) {
                if (dis[0][it->second] != 0) continue;
                dis[0][it->second] = dis[0][v] + 1;
                d.push_back(it->second);
                //++it;
            }
        }
    }
    {
        deque<int> d;
        d.push_back(n);
        while (!d.empty()) {
            int v = *(d.begin());
            d.pop_front();
            auto it = find_if(all(p), [&](PII &n){return n.first == v;});
            for (;it != p.end() && it->first == v;++it) {
                if (dis[1][it->second] != 0) continue;
                dis[1][it->second] = dis[1][v] + 1;
                d.push_back(it->second);
                //++it;
            }
        }
    }
    */
    int ans[2] = {};
    REP(i,1,n+1) {
        if (dis[0][i] <= dis[1][i]) ans[0]++;
        else ans[1]++;
    }
    if (ans[0] > ans[1]) cout << "Fennec" << endl;
    else cout << "Snuke" << endl;
    /*
    auto it = find_if(all(p), [](PII &n){return n.first = 1;});
    while (it->first == 1) {
        cout << it->second << endl;
        ++it;
    }
    */
    
     return 0;
}

Measured memory_bytes: 6540