#include <bits/stdc++.h>
using namespace std;

# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s)  std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define Yes(j) std::cout << (j ? "Yes" : "No") << endl;
# define yes(j) std::cout << (j ? "yes" : "no") << endl;
# define all(v) v.begin(),v.end()
# define showVector(v) REP(i,v.size()){p(v[i]);p(" ")} pl("")
template<class T> inline bool chmin(T &a, T b){ if(a > b) { a = b; return true;} return false;}
template<class T> inline bool chmax(T &a, T b){ if(a < b) { a = b; return true;} return false;}
typedef long long int ll;
typedef pair<ll,ll> P_ii;
typedef pair<double,double> P_dd;

template<class T>
vector<T> make_vec(size_t a){
    return vector<T>(a);
}

template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
  return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}

template<typename T,typename V>
typename enable_if<is_class<T>::value==0>::type
fill_v(T &t,const V &v){t=v;}

template<typename T,typename V>
typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t,const V &v){
  for(auto &e:t) fill_v(e,v);
}


const int MOD = 1000000007;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;

void addM(long long &a, long long b) {
    a += b;
    if (a >= MOD) a -= MOD;
}

void mulM(long long &a, long long b) {
    a = ((a%MOD)*(b%MOD))%MOD ;
}

// テーブルを作る前処理
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(ll n, ll k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main(){
    int N;
    cin >> N;

    vector<int> g[N];
    REP(i,N-1) {
        int a,b;
        cin >> a >> b;
        a--;b--;

        g[a].push_back(b);
        g[b].push_back(a);
    }

    vector<int> dist1(N,-1);
    vector<int> dist2(N,-1);

    queue<int> que;
    queue<int> n_que;

    que.push(0);
    ll d = 0;
    while(que.size()>0){
        while(que.size()>0){
            auto q = que.front();
            que.pop();
            if(dist1[q]!=-1) continue;

            dist1[q] = d;
            for(auto v:g[q]) n_que.push(v);
        }

        while (n_que.size()>0){
            auto q = n_que.front();
            n_que.pop();
            que.push(q);
        }
        d++;
    }

    que.push(N-1);
    d = 0;
    while(que.size()>0){
        while(que.size()>0){
            auto q = que.front();
            que.pop();
            if(dist2[q]!=-1) continue;

            dist2[q] = d;
            for(auto v:g[q]) n_que.push(v);
        }

        while (n_que.size()>0){
            auto q = n_que.front();
            n_que.pop();
            que.push(q);
        }
        d++;
    }

    ll count = 0;
    REP(i,N) if(dist1[i]<=dist2[i]) count++;

    if(count*2 > N) pl("Fennec")
    else pl("Snuke")

    return 0;
}

Measured memory_bytes: 6656