#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for(const auto& e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void yn(bool j){cout << (j ? "Yes" : "No") << endl; return;}
template<class Head> void pt(Head&& head){cout << head << endl; return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> long long bcount(T1 v, T2 a){return upper_index(v, a) - lower_index(v, a);} 
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

vector<vector<ll>> g;
ll N;
vector<ll> path;

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;

    UnionFind(ll sz_): par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }

    ll find(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }

    bool merge(ll x, ll y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return find(x) == find(y);
    }

    ll size(ll x) {
        return siz[find(x)];
    }
};


void dfs(vector<ll> &p, ll node, ll par = -1){
    p.push_back(node);
    if (node == N - 1){
        path = p;
        return;
    }
    eachdo(g[node], e){
        if (e == par) continue;
        dfs(p, e, node);
    }
    p.pop_back();
}

int main(){
    cin >> N;
    g.resize(N);
    rep(i, N - 1){
        ll a, b; cin >> a >> b;
        g[--a].push_back(--b);
        g[b].push_back(a);
    }
    vector<ll> t;
    dfs(t, 0);
    ll cut_u = path[(path.size() + 1) / 2 - 1];
    ll cut_v = path[(path.size() + 1) / 2];
    UnionFind uf(N);
    rep(i, N){
        eachdo(g[i], e){
            if (i <= e) continue;
            if ((i == cut_u && e == cut_v) || (e == cut_u && i == cut_v)) continue;
            uf.merge(i, e);
        }
    }
    pt(uf.size(0) > uf.size(N - 1) ? "Fennec" : "Snuke");
    // debug(path);
    // pt(uf.size(0), uf.size(N - 1));
}

Measured memory_bytes: 15220