#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<string>
#include<sstream>
#include<iomanip>
#include<utility>
#include<cmath>
#include<set>
#include<list>
#include<queue>
#include<stack>
#include<deque>
#include<map>
#include<set>
#include<cstring>
#include<iterator>
#include<bitset>
using namespace std;
 
struct edge {int /*from,*/to,cost;};
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,pair<int,int> > PP;
typedef vector<int> VI;
typedef vector<long long int> VL;
typedef vector<edge> VE;
static const int MOD = 1000000007;
//static const int INF = 2147483647;
//static const long long INF = 9223372000000000000;
//static const long long INF = 9223372000000000000/2;
static const int INF = 1000010000;
//int dx4[4] = {0,1,0,-1}, dy4[4] = {-1,0,1,0};
//int dx5[5] = {-1,0,0,0,1}, dy5[5] = {0,-1,0,1,0};
//int dx8[8] = {-1,0,1,1,1,0,-1,-1}, dy8[8] = {1,1,1,0,-1,-1,-1,0};
//int dx9[9] = {-1,0,1,1,1,0,-1,-1,0}, dy9[9] = {1,1,1,0,-1,-1,-1,0,0};
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define np next_permutation
#define pq priority_queue
#define UB upper_bound
#define LB lower_bound
#define SZ(a) int((a).size())
#define LEN(a) int((a).length())
#define MAX(a,b,c) max((a),max((b),(c)))
#define MIN(a,b,c) min((a),min((b),(c)))
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REP1(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREP1(i,x) for(int i=((int)(x));i>0;i--)
//#define int ll

int n;
VI G[114514];
int d[114514];
int pre[114514];
int fld[114514];
VI saitanro;

void bfs(int s){
    queue<P> que;
    fill(d,d+n,INF);
    fill(pre,pre+n,INF);
    d[s] = 0; pre[s] = -1;
    que.push(P(0,s));

    while(!que.empty()){
        P p=que.front(); que.pop();
        int v = p.second;
        if(d[v]<p.first) continue;
        for(int i=0;i<G[v].size();i++){
            int e = G[v][i];
            if(d[e]>d[v]+1){
                d[e] = d[v] + 1;
                pre[e] = v;
                que.push(P(d[e],e));
            }
        }
    }
}

void init(int m){
    REP(i,m) fld[i] = -1;
}

signed main(){
    scanf("%d",&n);
    REP(i,n-1){
        int s,t;
        scanf("%d%d",&s,&t);
        s--;t--;
        G[s].pb(t);
        G[t].pb(s);
    }
    bfs(0);
    init(n);

    int cur = n-1;
    while(cur!=-1){
        saitanro.pb(cur);
        cur = pre[cur];
    }
    reverse(all(saitanro));

    queue<int> snu;
    queue<int> fen;
    REP(i,SZ(saitanro)){
        if(i<(SZ(saitanro)+1)/2){
            fld[saitanro[i]] = 1;
            fen.push(saitanro[i]);
        } else {
            fld[saitanro[i]] = 0;
            snu.push(saitanro[i]);
        }
    }

    while(!fen.empty()){
        int p=fen.front(); fen.pop();
        //printf("fennec : %d\n",p);
        for(int i=0;i<G[p].size();i++){
            int e = G[p][i];
            if(fld[e]==-1){
                fld[e] = 1;
                fen.push(e);
            }
        }
    }

    while(!snu.empty()){
        int p=snu.front(); snu.pop();
        //printf("snuke : %d\n",p);
        for(int i=0;i<G[p].size();i++){
            int e = G[p][i];
            if(fld[e]==-1){
                fld[e] = 0;
                snu.push(e);
            }
        }
    }

    /*REP(i,SZ(saitanro)) printf("%d ",saitanro[i]);
    printf("\n");
    REP(i,n) printf("%d ",d[i]);
    printf("\n");
    REP(i,n) printf("%d ",fld[i]);
    printf("\n");*/

    int fennec = 0;
    int snuke = 0;

    REP(i,n) fld[i] ? fennec++ : snuke++;
    fennec > snuke ? puts("Fennec") : puts("Snuke");

    return 0;
}

Measured memory_bytes: 8056