#include <bits/stdc++.h>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const ll inf =1LL << 62;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

vi path;
int n;
vector<vi> graph;

vi used;
bool dfs(int v){
    used[v] = true;

    if(v == n - 1){
        path.emplace_back(v);
        return true;
    }

    bool ret = false;
    for(auto nv : graph[v]){
        if(used[nv]) continue;
        if(ret |= dfs(nv)){
            path.emplace_back(v);
            break;
        }
    }
    return ret;
}

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

    cin >> n;
    graph = vector<vi>(n);
    rep(loop, n - 1){
        int a, b; cin >> a >> b; a--, b--;
        graph[a].emplace_back(b);
        graph[b].emplace_back(a);
    }

    used = vi(n);
    dfs(0);

    int turn = 0;
    int a = 0, b = n - 1;
    used = vi(n, -1);
    int len = path.size();
    reverse(_all(path));
    // for(auto& e : path) cerr << ": " << e << endl;
    queue<int> q;
    rep(i, len){
        if(i < (len + 1) / 2){
            used[path[i]] = 0;
        }
        else {
            used[path[i]] = 1;
        }
        q.push(path[i]);
    }

    while(q.size()){
        int v = q.front(); q.pop();

        for(auto& nv : graph[v]){
            if(used[nv] != -1) continue;
            used[nv] = used[v];
            q.push(nv);
        }
    }
    // for(auto& e:  used) cerr << e << endl;

    int bcnt = 0, wcnt = 0;
    rep(i, n){
        if(used[i] == 0) bcnt++;
        if(used[i] == 1) wcnt++;
    }
    assert(bcnt + wcnt == n);

    if(bcnt > wcnt){
        cout << "Fennec" << endl;
    }
    else {
        cout << "Snuke" << endl;
    }

    return 0;
}


Measured memory_bytes: 11768